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

Solution: 1

The naive approach to this problem would be:

1. Traverse the list starting from 0th index to the last index
2. Compare value at each index lst[i] with the given input integer $x$
3. When you hit the maximum value lesser than equal to $x$, store it as the $floor$