Data Structures and Algorithms:

I wasn't satisified with another answer on chegg that attempted to solve this problem. I'm hoping someone can give me a clear expanation when outlining their algorithm with worst case asymptotic time complexity of O(n log(n)).

7. (10 pts) Given an integer array A of size n and an integer z, design an algorithm for computing if there are two elements in A that sum to x. Outline the main steps in the algorithm and reason about its complexity. You may use any of the algorithms that we have discussed. Try to outline an algorithm with worst case asymptotic time complexity of O(n log n). If you cannot come up with O(n log n) algorithm, outline the brute force algorithm and justify its complexity (for half the credit)