Home
C++ Tutorial
Language Basics
Data Types
Operators statements
Array
Development
Exceptions
Function
Structure
Class
Operator Overloading
Pointer
File Stream
template
STL Introduction
string
vector
list
bitset
set multiset
valarray
queue stack
deque
map multimap
STL Algorithms Modifying sequence operations
STL Algorithms Non modifying sequence operations
STL Algorithms Binary search
STL Algorithms Sorting
STL Algorithms Merge
STL Algorithms Min Max
STL Algorithms Iterator
STL Algorithms Heap
STL Algorithms Helper
adjacent_find « STL Algorithms Non modifying sequence operations « C++ Tutorial
C++ Tutorial
STL Algorithms Non modifying sequence operations
adjacent_find
25.1.adjacent_find
25.1.1.
adjacent_find: search first two elements with equal value
25.1.2.
Illustrating the generic adjacent_find algorithm
25.1.3.
adjacent_find: search first two elements for which the second has double the value of the first
25.1.4.
Use generic adjacent_find algorithm with a predicate to find the first name that is lexicographically greater than the next one