Solution: Find the Floor and Ceil of a Number in a Sorted Array

Solution 1

The naive approach to this problem would be:

1. Traverse the array starting from the 0th index to the last index.
2. Compare value at each index arr[i] with the given input integer $x$.
3. When you reach the maximum value lesser than equal to $x$

...