12 ways to search a range - Algorithms from the C++ standard library скачать в хорошем качестве

12 ways to search a range - Algorithms from the C++ standard library

In this Bits of Q tutorial we will be talking about the various search and find algoriths the standard library. We'll look at algorithms for both sorted and unsorted ranges that can be used for finding either a single element or a range of elements. Related material: Iterators & Iterator categories:    • Iterators and iterator categories in C++   Algorithms from the standard library playlist:    • Algorithms from the C++ standard library   -- TIMESTAMPS -- 00:00 - Introduction 00:30 - std::find 01:10 - std::find_if(_not) 01:43 - std::find_first_of 02:54 - std::adjacent_find 03:31 - std::search 04:15 - std::find_end 04:35 - std::search_n 04:51 - Overview: algorithms on unsorted ranges 05:09 - Equality vs Equivalence 05:47 - std::binary_search 06:07 - Example: Equivalence != Equality 06:41 - std::equal_range 07:13 - std::lower_bound / std::upper_bound 07:45 - Overview of all algorithms If you have any questions or feedback, just leave a comment below. See you next time!