Solution: Find the Floor and Ceil of a Number

Solution

We can make use of the fact that the array is sorted. So, by a little modification of the binary search algorithm, we can successfully crack this problem. The core idea remains the same: we divide the array at the midpoint and search for the key either in left or right subarray based on the comparison with a given number.

Here is the complete working solution: