Contents A-Z

A-B

C

D-E

F

G-H

I

L

M

N

P

R

S

T

U-Z

Standard Range Algorithms C++20 Standard Range Algorithms C++20 Range Algos

single range objects (containers/views) can be used as input (before C++20: only iterator pairs)
input requirements are checked using Concepts
don't take part in Argument Dependent Lookup (= look up a function in namespaces of its arguments)

Non-Modifying Operations Non-Modifying Non-Mod.

Existence Queries Existence

standard library algorithm 'any_of' visual example

standard library algorithm 'all_of' visual example

standard library algorithm 'none_of' visual example

standard library algorithm 'count' visual example

standard library algorithm 'count_if' visual example

Finding / Locating Elements Locate

Find Single Elements

standard library algorithm 'find' visual example

standard library algorithm 'find_if' visual example

standard library algorithm 'find_if_not' visual example

standard library algorithm 'find_last' visual example

standard library algorithm 'find_last_if' visual example

standard library algorithm 'find_last_if_not' visual example

standard library algorithm 'find_first_of' visual example

finds the 1^st matching position in range_S of any element contained in range_W

Find Consecutive Runs of Equal Elements

standard library algorithm 'adjacent_find' visual example

standard library algorithm 'search_n' visual example

Find Subranges

standard library algorithm 'find_end' visual example

standard library algorithm 'starts_with' visual example

standard library algorithm 'ends_with' visual example

Comparing Ranges Compare

standard library algorithm 'equal' visual example

standard library algorithm 'mismatch' visual example

standard library algorithm 'lexicographical_compare' visual example

Binary Search of Sorted Ranges Binary Search Binary Search

standard library algorithm 'binary_search' visual example

standard library algorithm 'lower_bound' visual example

standard library algorithm 'upper_bound' visual example

standard library algorithm 'equal_range' visual example

standard library algorithm 'includes' visual example

Minimum / Maximum Min/Max

standard library algorithm 'min_element' visual example

standard library algorithm 'max_element' visual example

standard library algorithm 'minmax_element' visual example

Structural Properties Structural

standard library algorithm 'is_sorted' visual example

standard library algorithm 'is_sorted_until' visual example

standard library algorithm 'is_partitioned' visual example

standard library algorithm 'partition_point' visual example

standard library algorithm 'is_permutation' visual example

standard library algorithm 'is_heap' visual example

standard library algorithm 'is_heap_until' visual example

Traversing Ranges Traversal

standard library algorithm 'for_each' visual example

Copying / Moving / Swapping Elements Copy/Move/Swap Copy/Move

standard library algorithm 'copy' visual example

standard library algorithm 'copy_backward' visual example

standard library algorithm 'copy_if' visual example

standard library algorithm 'move' visual example

standard library algorithm 'move_backward' visual example

Random Sampling

standard library algorithm 'sample' visual example

Swapping

standard library algorithm 'swap_ranges' visual example

Reordering Elements Reordering Reorder

Shifting Shift

standard library algorithm 'reverse' visual example

standard library algorithm 'reverse_copy' visual example

standard library algorithm 'rotate' visual example

standard library algorithm 'rotate_copy' visual example

standard library algorithm 'shift_left' visual example

standard library algorithm 'shift_right' visual example

Shift Randomly Randomly

standard library algorithm 'shuffle' visual example

Sorting Sort

standard library algorithm 'sort' visual example

standard library algorithm 'stable_sort' visual example

standard library algorithm 'partial_sort' visual example

standard library algorithm 'partial_sort_copy' visual example

standard library algorithm 'nth_element' visual example

standard library algorithm 'is_sorted' visual example

standard library algorithm 'is_sorted_until' visual example

Partitioning Partition

standard library algorithm 'partition' visual example

standard library algorithm 'partition_copy' visual example

standard library algorithm 'stable_partition' visual example

standard library algorithm 'is_partitioned' visual example

standard library algorithm 'partition_point' visual example

Permutations Permute

standard library algorithm 'next_permutation' visual example

standard library algorithm 'prev_permutation' visual example

standard library algorithm 'is_permutation' visual example

Heap Operations Heaps

for using contiguous containers (std::array, std::vector, …) as a max heap, i.e., a (conceptual) binary tree where each parent has a larger value than its children

standard library algorithm 'make_heap' visual example

standard library algorithm 'push_heap' visual example

standard library algorithm 'pop_heap' visual example

standard library algorithm 'sort_heap' visual example

standard library algorithm 'is_heap' visual example

standard library algorithm 'is_heap_until' visual example

Modifying Elements Modify

Changing Values

standard library algorithm 'fill' visual example

standard library algorithm 'generate' visual example

standard library algorithm 'ranges-transform' visual example

standard library algorithm 'ranges-transform2' visual example

Replacing Values Replace

standard library algorithm 'replace' visual example

standard library algorithm 'replace_if' visual example

standard library algorithm 'replace_copy' visual example

standard library algorithm 'replace_copy_if' visual example

Removing Remove

standard library algorithm 'remove' visual example

standard library algorithm 'remove_if' visual example

standard library algorithm 'remove_copy' visual example

standard library algorithm 'remove_copy_if' visual example

standard library algorithm 'unique' visual example

standard library algorithm 'unique_copy' visual example

standard library algorithm 'erase' visual example

standard library algorithm 'erase_if' visual example

Sorted Range Operations Sorted Ranges

standard library algorithm 'merge' visual example

standard library algorithm 'inplace_merge' visual example

Sorted Ranges As Sets

standard library algorithm 'set_union' visual example

standard library algorithm 'set_intersection' visual example

standard library algorithm 'set_difference' visual example

standard library algorithm 'set_symmetric_difference' visual example

Numeric Operations Numeric

`#include <numeric>`

standard library algorithm 'iota' visual example

Legend (Parameter Iconography)

legend of symbols and colors used in algorithm visualizations

Beginner's Guide Articles Guide Articles

Related …

Classic Iterator Pair Algorithms Overview

A Tour of C++: Containers and Algorithms

Last updated: 2022-11-20

Comments…