🏰 Cave of Floors

📚 Floor Function with Binary Search

The floor of K in a sorted array is the largest element ≤ K.

• If arr[mid] ≤ K: Store as possible answer, search right for better
• If arr[mid] > K: Too big! Search left
• The last stored valid answer is the floor