Binary Search

A fast search with a search time of O(log n) has been predefined in C++.

We'll cover the following...

The binary search algorithms use the fact that the ranges are already sorted. To search for an element, use std::binary_search. With std::lower_bound, we get an iterator for the first element, not smaller than the given value. With ...