C++ Standard Algorithms Examples and Templates

Can you explain what C++ standard algorithms are?

C++ standard algorithms are a set of functions provided by the C++ Standard Library that perform operations on collections, such as sorting, searching, and transforming data.

Can you give me an example of using the sort algorithm?

Sure! Here's a simple example:

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

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

This code sorts the vector in ascending order.

What about using the find algorithm?

The std::find algorithm searches for a specific value in a range. Here's an example:

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

int main() {
    std::vector<int> vec = {1, 2, 3, 4, 5};
    auto it = std::find(vec.begin(), vec.end(), 3);
    if (it != vec.end()) {
        std::cout << "Found: " << *it;
    } else {
        std::cout << "Not found";
    }
    return 0;
}

Can you provide templates for these algorithms?

Certainly! Here are templates for sort and find:

1. Sort Template:

template <typename T>
void sortVector(std::vector<T>& vec) {
    std::sort(vec.begin(), vec.end());
}

2. Find Template:

template <typename T>
bool findInVector(const std::vector<T>& vec, const T& value) {
    return std::find(vec.begin(), vec.end(), value) != vec.end();
}