Algorithm (C++)
Appearance
C++ Standard Library |
---|
Containers |
C standard library |
In the C++ programming language, algorithms are components that perform algorithmic operations on containers and other sequences.[1]
The C++ standard provides some standard algorithms collected in the <algorithm> standard header. All algorithms are in the std
namespace.
Category
- Non-modifying sequence operations (e.g. find_if, count, search)
- Modifying sequence operations (e.g. replace, remove, reverse)
- Sorting (e.g. sort, stable_sort, partial_sort)
- Binary search (e.g. lower_bound, upper_bound)
- Heap (e.g. make_heap, push_heap)
- Min/max (e.g. min, max)
A few algorithms
OutputIterator copy(InputIterator source_begin, InputIterator source_end, OutputIterator destination_begin)
void fill(ForwardIterator destination_begin, ForwardIterator destination_end, T value)
InputIterator find(InputIterator begin, InputIterator end, T search_object)
(returns an iterator the found object orend
if the object isn't found)const T& max(const T& a, const T& b)
returns the greater of the two argumentsForwardIterator max_element(ForwardIterator begin, ForwardIterator end)
finds the maximum element of a rangeconst T& min(const T& a, const T& b)
returns the smaller of the two argumentsForwardIterator min_element(ForwardIterator begin, ForwardIterator end)
finds the minimum element of a range
References
- ^ ISO/IEC (2003). ISO/IEC 14882:2003(E): Programming Languages - C++ §25 Algorithms library [lib.algorithms] para. 1