What is the C++ Standard Template Library (STL) algorithm?

Can you explain what the C++ Standard Template Library (STL) algorithm is?

The C++ Standard Template Library (STL) algorithm is a collection of functions designed to operate on ranges of elements, such as arrays or vectors. It includes algorithms for searching, sorting, transforming, and manipulating data.

What are some common algorithms available in the STL?

Some common STL algorithms include sort, find, copy, accumulate, and reverse. Each serves a specific purpose for data manipulation.

How do I use the sort algorithm in C++?

To use the sort algorithm, include the <algorithm> header and call std::sort(begin, end); where 'begin' and 'end' are iterators defining the range to sort.

Can you give me an example of sorting a vector?

Sure! Here's a simple example:

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    std::vector<int> vec = {5, 2, 9, 1, 5, 6};
    std::sort(vec.begin(), vec.end());
    for(int n : vec) std::cout << n << ' '; // Output: 1 2 5 5 6 9
}