Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
C++ STL algorithm - search (find, find_if, search, adjacent_find) | Modern Cpp Series Ep. 143
Play lesson

The C++ Programming Language - C++ STL algorithm - search (find, find_if, search, adjacent_find) | Modern Cpp Series Ep. 143

4.0 (5)
38 learners

What you'll learn

This course includes

  • 68.3 hours of video
  • Certificate of completion
  • Access on mobile and TV

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

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere