Flash cards
Review the key moves
1/3
Core idea
What is the main idea behind C++ algorithm Library?
Lesson checks
Practice each idea before moving on
Short Mimo-style checks built from this lesson's code, terms, and sequence.
1Quick choice
Which statement best captures the main point of this lesson?
2Order
Put the learning moves in the order that makes the concept easiest to apply.
A list of useful functions in the algorithm library can be found below.
The <algorithm> library has many functions that allow you to modify ranges of data from data structures.
C++ algorithm Library
The <algorithm> library has many functions that allow you to modify ranges of data from data structures.
A list of useful functions in the algorithm library can be found below.
| Function | Description |
|---|---|
| adjacent_find() | Finds a pair of consecutive elements with the same value in a data range |
| all_of() | Checks if all of the elements in a data range match a condition |
| any_of() | Checks if at least one element in a data range matches a condition |
| binary_search() | An efficient algorithm for finding if a value exists in a sorted data range |
| copy() | Copies the values from a data range into a different data range |
| count() | Counts the number of times that a value occurs in a data range |
| count_if() | Counts the number of elements in a data range that match a condition |
| fill() | Writes a value into every element of a data range |
| find() | Finds the first element of a data range with a specified value |
| find_first_of() | Finds the first element of a data range which matches one of several specified values |
| find_if() | Finds the first element of a data range which matches a condition |
| find_if_not() | Finds the first element of a data range which does not match a condition |
| for_each() | Runs a function on every element in a data range |
| includes() | Checks if all of the values in a sorted data range exist in another sorted data range |
| is_permutation() | Checks if a data range is a permutation of another |
| is_sorted() | Checks if a data range is sorted |
| is_sorted_until() | Finds the position in a data range at which elements are no longer sorted |
| lower_bound() | Finds the first element at or above a specified lower bound in a sorted data range |
| max_element() | Finds the element with the highest value in a data range |
| merge() | Merges the values of two data ranges into a new data range |
| min_element() | Finds the element with the lowest value in a data range |
| none_of() | Checks if none of the elements in a data range match a condition |
| random_shuffle() | Randomly rearranges the elements in a data range |
| replace() | Replaces all occurrences of a value in a data range with a different value |
| replace_copy() | Creates a copy of a data range with all occurrences of a specified value replaced with a different value |
| replace_copy_if() | Creates a copy of a data rage where all values that match a condition are replaced with a different value |
| replace_if() | Replaces all values in a data range that match a condition with a different value |
| reverse() | Reverses the order of elements in a data range |
| reverse_copy() | Creates a copy of a data range with the elements in reverse order |
| search() | Finds a specified sequence of values in a data range |
| sort() | Sorts the values of a data range in ascending order |
| swap() | Swaps the values of two variables |
| swap_ranges() | Swaps the values of two data ranges of the same size |
| upper_bound() | Finds the first element above a specified upper bound in a sorted data range |
Learn more about algorithms in our C++ Algorithm Tutorial .