Evaluate the Two Sum solution with two pointers: sort the array, move pointers from ends, shift the right pointer when sum is too large, and the left otherwise. What are its limitations and complexities?