Add sorting complexity note and hash map intuition for Two Sum (#2612)

Clarify that sorting adds O(n log n), and explain the hash map
approach: check if the complement (target - element) exists.

Co-authored-by: Claude Opus 4.5 <noreply@anthropic.com>