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

preview_player
Показать описание

►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.

►Please like and subscribe to help the channel!
Рекомендации по теме
Комментарии
Автор

@MikeShah i wanted to learn computer graphics should i start reading computer graphics principles and practise.

arjunkandaswamy
Автор

You're so awesome 😎😎😎 thank you again for another great video in the modern c++ series 🧠🤯🤠🦘🥳🥳

VoidloniXaarii
visit shbcf.ru