Binarysearch
Overview
Binary 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.Section Pages
lower bound
Finds the first element greater than or equal to a given value
upper bound
Finds the first element greater than a given value
equal range
Returns the range of elements equal to a given value
binary search
Returns whether the range contains an element