The 31st --- the 52nd

The first 31 return

The ordinary iterator in the following figure  ivec.begin() and   Reverse Iterators  ivec.rend() Is the corresponding

The first 32 return

adjacent_find()    Find continuous 2 Data that conforms to predicate rules

All the algorithms in the following figure are applicable to any container , In the first red box is the exact search algorithm , The second red box is to find a piece of data that matches continuously , The third red box is to find the first data that appears , The first 4 The red box is to find continuous 2 Data that conforms to predicate rules

The first 33 return

The first 34 return

The search algorithms in the above figure are Ordered interval Search algorithm of

The first 35 return

for_each()  There is a return value , The return value is for_each() Function objects in , As shown in the figure below

The first 36 return

The first 37 return

The first 38 return

The first 39 return

The first 40 return

The first 41 return

fill（） The algorithm can only fill in fixed values （ Constant values ）

generate（） Algorithms can fill functions or function objects

The first 42 return

The first 43 return

That is to say, after the deletion algorithm runs , The number of data elements in the container has not decreased

And member functions erase（） Is the real deletion

The first 44 return

The first 45 return

unique（） The deletion algorithm is to delete continuity Elements of repetition , Only one element is left

The first 46 return

The first 47 return

The first 48 return

The first 49 return

Be careful ：sort Algorithms cannot be used for list Linked list , because sort The algorithm requires the use of random access iterators

The first 50 return

The first 51 return

The first 52 return