Explore the full potential of C++ by mastering the standard library.

Become a C++ Programmer

The C++ standard library is a collection of all the tools and utilities available in C++. It received its latest update in 2017, known as C++17. The update introduces many new features that further optimize our code. This module will help us fully grasp C++ and use it to its full potential.

C++ Standard Library

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` you get an iterator for the first element, being no smaller than the given value. With `std::upper_bound` you get an iterator back for the first element, which is bigger than the given value. `std:::equal_range` combines both algorithms.

If the container has n elements, you need on average **log<sub>2</sub>(n)** comparisons for the search. The binary search requires that you use the same comparison criterion that you used for sorting the container. Per default the comparison criterion is `std::less`, but you can adjust it. Your sorting criterion has to obey the [strict weak ordering](https://en.wikipedia.org/wiki/Weak_ordering). If not, the program is undefined. 

If you have an unordered associative container, the methods of the [unordered associative container](https://www.educative.io/courses/cpp-standard-library-including-cpp-14-and-cpp-17/overview-B81Y5KM2GRQ) are in general faster.

Searches the element `val` in the range:

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

Binary Search