Home
C++
Bitset
Class
Console
Data Structure
Data Type
Deque
Development
File
Function
Generic
Language
List
Map Multimap
Overload
Pointer
Qt
Queue Stack
Set Multiset
STL Algorithms Binary search
STL Algorithms Heap
STL Algorithms Helper
STL Algorithms Iterator
STL Algorithms Merge
STL Algorithms Min Max
STL Algorithms Modifying sequence operations
STL Algorithms Non modifying sequence operations
STL Algorithms Sorting
STL Basics
String
Valarray
Vector
adjacent_find « STL Algorithms Non modifying sequence operations « C++
C++
STL Algorithms Non modifying sequence operations
adjacent_find
1.
adjacent_find: search first two elements with equal value
2.
Illustrating the generic adjacent_find algorithm
3.
adjacent_find: search first two elements for which the second has double the value of the first
4.
Use generic adjacent_find algorithm with a predicate to find the first name that is lexicographically greater than the next one