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 sorting, searching, and manipulating data.

What are some common STL algorithms I should know?

Some common STL algorithms include sort, find, copy, accumulate, and transform. Each serves different purposes 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 pointing to the range you want to sort.

Can you give me an example of using sort?

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 << ' ';
}

This will sort the vector in ascending order.