Summary
Full Transcript
►Full C++ Series Playlist: https://www.youtube.com/playlist?list=PLvv0ScY6vfd8j-tlhYVPYgiIyXduu6m-L ►Find full courses on: https://courses.mshah.io/ ►Join as Member to Support the channel: https://www.youtube.com/channel/UCA64pZbN5Mz5NxC3SO4qpDg/join ►Lesson Description: In this lesson I show you the non-modifying sequence algorithms for searching. We'll work through several examples using find, find_if, search, and adjacent find. These algorithms (i.e. function templates) do not modify the data structure, but typically take a pair of iterators (the range to search) and a value or range to search for. I've found they can be helpful in string search or image processing applications personally. ►YouTube Channel: https://www.youtube.com/c/MikeShah ►Please like and subscribe to help the channel! ►Join our free community: https://courses.mshah.io/communities/Q29tbXVuaXR5LTI3MzAz
