9. Algorithms

The Standard Template Library has a large number of algorithms to work with containers and their elements. As the algorithms are function templates, they are independent of the type of the container elements. The glue between the containers and algorithms are the iterators. If your container supports the interface of an STL container, you can apply the algorithms on your container.

Generic programming with the algorithmn

// algorithm.cpp 
...
#include <algorithm>
...
template <typename Cont, typename T>
void doTheSame(Cont cont, T t){
  for (const auto c: cont) std::cout << c << " ";
  std::cout << cont.size() << std::endl;
  std::reverse(cont.begin(), cont.end());
  for (const auto c: cont) std::cout << c << " ";
  std::reverse(cont.begin(), cont.end());
  for (const auto c: cont) std::cout << c << " ";
  auto It= std::find(cont.begin(), cont.end(), t);
  std::reverse(It, cont...