Given an array and an element \(x\), the floor of an element \(x\) is defined as the greatest element present in the array which is less than or equal to \(x\).

What is the worst case complexity of the most efficient algorithm for finding a floor of an element \(x\) in a sorted array?

**Details and Assumptions**:

If the array is \([3, 8, 15, 19, 23]\) and \(x=20\), then the output will be \(19\).

\(x\) can't be less than the minimum element in the list.

×

Problem Loading...

Note Loading...

Set Loading...