You are given an array S[1,...,n] of n (distinct) numbers, where the numbers in the array are arranged in increasing-increasing order, i.e., S[i]

Here is another problem which is similar that i understand how to do but idk how to go about this one:

Exercise 2.6. You are given a sorted array S[1,...,n] of n (distinct) numbers,i.e.,the numbers in the array are arranged in increasing order: S[1]

that's the answer for 2.6

The algorithm is very similar to the binary search algorithm for the Square root problem. But care has to be taken to avoid "off-by-one" type errors (in setting the termination condition and the low and high values.) Algorithm 1 Algorithm Binary-Search(n). Input: Sorted array S[1,... ,n] and an element x. Output: If x is in S, then i such that Si or output "null" 1: low-1// Low value of guess 2: high - n // High value of guess 3: while low