C++ STL algorithm - lower_bound, upper_bound, binary_search | Modern Cpp Series Ep. 168
►Full C++ Series Playlist: • The C++ Programming Language
►Find full courses on: https://courses.mshah.io/
►Join as Member to Support the channel: / @mikeshah
►Lesson Description: In this lesson we look at the binary_search, lower_bound, and upper_bound algorithms which are building blocks for search. Many containers have a 'find' already built-in that may be logrithmic. However, binary_search is useful for again returning a bool value, searching partial ranges, flattening a data structure, or otherwise used with lower_bound and upper_bound for queries on where to perform potential insertions.
►YouTube Channel: / mikeshah
►Please like and subscribe to help the channel!
►Join our free community: https://courses.mshah.io/communities/...