$(20\%)$ Given a set of $S$ of $n$ integers and another integer $x,$ we want to determine whether or not there exist two elements in $S$ whose sum is exactly $x.$

Design a brute$-$force algorithm to solve it$.$ What is the time complexity?

Design an algorithm to solve this problem in $O(nlogn)$ worst$-$case time.