What are the basics of STL algorithms in C++?

What are the basics of STL algorithms in C++?

STL algorithms are a set of functions in the C++ Standard Library that operate on containers. They include operations like sorting, searching, and manipulating data.

Can you give me an example of a sorting algorithm in STL?

Sure! The std::sort function is commonly used to sort elements in a container. For example, std::sort(vec.begin(), vec.end()); sorts the elements in the vector vec.

What about searching algorithms?

For searching, you can use std::find to locate an element in a container. For example, std::find(vec.begin(), vec.end(), value); returns an iterator to the found element or vec.end() if not found.

Are there any algorithms for manipulating data?

Yes! You can use std::transform to apply a function to a range of elements. For instance, std::transform(vec.begin(), vec.end(), vec.begin(), [](int x) { return x * 2; }); doubles each element in the vector.