Explore iterative algorithms in C++

C is a popular programming language that provides many iterative algorithms for processing collection data. In this article, we will explore the details of iterative algorithms in C.

What is an iterative algorithm?

An iterative algorithm is an algorithm based on repeated application of a process or instructions. In programming, loops are one of the most commonly used iterative algorithms. Iteration refers to gradually approaching the desired result by repeatedly performing the same operation. In programming, loop statements are often used to perform iteration.

Iteration algorithms in C

In C, the standard library provides a number of different iteration algorithms that use iterators to access elements in a container.

Iterator is a pointer object that can access elements in a container. Iterators provide traversal of elements in a container and allow us to process data.

The following are some commonly used iterative algorithms in the C standard library:

1. for_each

for_each is a simple and useful algorithm that can Execute a function for each element in the given container.

The following is an example:

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

void display(int i) {
    std::cout << i << " ";
}

int main() {
    std::vector<int> v {1, 2, 3, 4, 5};
    std::for_each(v.begin(), v.end(), display);
    return 0;
}

This program will output 1 2 3 4 5.

2. find

The find algorithm is used to find elements in a container and returns an iterator of the first matching element.

The following is an example:

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

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

This program will output Found 3.

3. sort

The sort algorithm is used to sort the elements in the container according to the specified comparison function.

The following is an example:

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

int main() {
    std::vector<int> v {5,2,7,4,3,6,1};
    std::sort(v.begin(), v.end());
    for (int i : v) {
        std::cout << i << " ";
    }
    return 0;
}

This program will output 1 2 3 4 5 6 7.

4. accumulate

The accumulate algorithm is used to accumulate elements in a container to an initial value.

The following is an example:

#include <numeric>
#include <vector>
#include <iostream>

int main() {
    std::vector<int> v {1, 2, 3, 4, 5};
    int sum = std::accumulate(v.begin(), v.end(), 0);
    std::cout << "Sum: " << sum << std::endl;
    return 0;
}

This program will output Sum: 15.

5. transform

The transform algorithm is used to apply a function to elements in a container and store the result in another container.

The following is an example:

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

int square(int i) {
    return i * i;
}

int main() {
    std::vector<int> v {1, 2, 3, 4, 5};
    std::vector<int> v2(v.size());
    std::transform(v.begin(), v.end(), v2.begin(), square);
    for (int i : v2) {
        std::cout << i << " ";
    }
    return 0;
}

This program will output 1 4 9 16 25.

Summary

The iterative algorithm is a popular algorithm suitable for processing collection data. In C, the standard library provides a number of different iteration algorithms that provide a convenient way to process elements in a container. We can use these algorithms to traverse, find, and modify elements in a container. Proficient in the iterative algorithm in C can help us better process collection data and improve our programming efficiency.

The above is the detailed content of Explore iterative algorithms in C++. For more information, please follow other related articles on the PHP Chinese website!