Given an array storing integers ordered by value, modify the binary search routine to return the position

Question:

Given an array storing integers ordered by value, modify the binary search routine to return the position of the integer with the greatest value less than K when K itself does not appear in the array. Return ERROR if the least value in the array is greater than K.

Fantastic news! We've Found the answer you've been seeking!