+1 (218) 451-4151
glass
pen
clip
papers
heaphones

Suppose you are given an array, A, containing n distinct integers that are listed in increasing…

Suppose you are given an array, A, containing n distinct integers that are listed in increasing…

Suppose you are given an array, A, containing n distinct integers that are listed in increasing order. Given a number k, describe a recursive algorithm to find two integers in A that sum to k, if such a pair exists. What is the running time of your algorithm?