A recursive algorithm to find two integers in an array that sums to a given integer

Question

I need an algorithm to determine if an array contains two elements that sum to a given integer.

The array is sorted.

The algorithm should be recursiv

Answer 1

Sort the array. Search for the complement of each number (sum-number). Complexity O(nlogn).