Describe an (n) algorithm that takes as input an array A of n real numbers sorted in nondecreasing order and a value x. The algorithm returns true if there are distinct indexes i and j such that A[i] + A[j] = x and false otherwise.