OverviewBinary Search Algorithms require that the ranges on which they operate are sorted according to their sorting criterion. Regarding the time and memory, these algorithms are superior.
Finds the first element greater than or equal to a given value
Finds the first element greater than a given value
Returns the range of elements equal to a given value
Returns whether the range contains an element