الگوریتمستان - فایل سرآیند algorithm

bool all_of(InputIterator first, InputIterator last, UnaryPredicate pred)

bool any_of(InputIterator first, InputIterator last, UnaryPredicate pred)

bool none_of(InputIterator first, InputIterator last, UnaryPredicate pred)

Function for_each(InputIterator first, InputIterator last, Function fn)

InputIterator find_if(InputIterator first, InputIterator last, UnaryPredicate pred)

InputIterator find_first_of(InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2)

typename iterator_traits<InputIterator>::difference_type count(InputIterator first, InputIterator last, const T &val)

typename iterator_traits<InputIterator>::difference_type count_if(InputIterator first, InputIterator last, UnaryPredicate pred)

bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2)

OutputIterator copy(InputIterator first, InputIterator last, OutputIterator result)

void swap(T &a, T &b)

void replace(ForwardIterator first, ForwardIterator last, const T &old_value, const T &new_value)

void fill(ForwardIterator first, ForwardIterator last, const T &val)

ForwardIterator unique(ForwardIterator first, ForwardIterator last)

ForwardIterator remove(ForwardIterator first, ForwardIterator last, const T &val)

void reverse(BidirectionalIterator first, BidirectionalIterator last)

void shuffle(RandomAccessIterator first, RandomAccessIterator last, URNG& &g)

void sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp)

ForwardIterator max_element(ForwardIterator first, ForwardIterator last)

ForwardIterator min_element(ForwardIterator first, ForwardIterator last)

#include <iostream>

#include <algorithm>

#include <array>

#include <list>

#include <ctime>

using namespace std;

bool isOdd(int x) {

    return (x % 2);

}

void print(int x) {

    cout << x << " ";

}

int main()

    const int len = 5;

    int arr1[] = {7, 3, 4, 2, 3};

    array<int, len> arr2{{8, 2, 0, 4, 6} };

    list<int> arr3(arr2.begin(), arr2.end());

    shuffle(arr2.begin(), arr2.end(), default_random_engine(time(NULL)));

    cout << "arr2 after shuffle: ";

    for_each(arr2.begin(), arr2.end(), print);

    // arr2 after shuffle: 0 8 2 4 6

    cout << endl;

    if(all_of(arr1, arr1 + len, isOdd))

        cout << "All the elements of arr1 are odd." << endl;

    else

        cout << "At least one of the elements in arr1 is not odd." << endl;

    // At least one of the elements in arr1 is not odd.

    if(any_of(arr1, arr1 + len, isOdd))

        cout << "At least one of the elements in arr1 is odd." << endl;

    else

        cout << "All the elements of arr1 are even." << endl;

    //  At least one of the elements in arr1 is odd.

    if(none_of(arr2.begin(), arr2.end(),isOdd))

        cout << "All the elements of arr2 are even." << endl;

    else

        cout << "At least one of the elements in arr2 is odd." << endl;

      //  All the elements of arr2 are even.

    auto v1 = find_if(arr1, arr1 + len, isOdd);

    cout << "The first odd element in arr1 is " << *v1 << "." << endl;

    // The first odd element in arr1 is 7.

    auto v2 = find_first_of(arr1, arr1 + len, arr2.begin(), arr2.end());

    cout << "The first element of arr2 in arr1 is " << *v2 << "." << endl;

    //  The first element of arr2 in arr1 is 4.

    cout << "#3 in arr1 is " << count(arr1, arr1 + len, 3) << "." << endl;

    //  #3 in arr1 is 2.

    cout << "#Odd_Numbers in arr1 is " << count_if(arr1, arr1 + len, isOdd) << "." << endl;

    // #Odd_Numbers in arr1 is 3.

    if(is_permutation(arr1, arr1 + len, arr3.begin()))

        cout << "arr3 is a permutation of arr1." << endl;

    else

        cout << "arr3 is not a permutation of arr1." << endl;

    // arr3 is not a permutation of arr1.

    if(is_permutation(arr3.begin(), arr3.end(), arr2.begin()))

        cout << "arr3 is a permutation of arr2." << endl;

    else

        cout << "arr3 is not a permutation of arr2." << endl;

    //  arr3 is a permutation of arr2.

    cout << "arr3 before copy: ";

    for_each(arr3.begin(), arr3.end(), print);

    //  arr3 before copy: 8 2 0 4 6

    copy(arr1 + 1, arr1 + 3, arr3.begin());

    cout << endl << "arr3 after copy: ";

    for_each(arr3.begin(), arr3.end(), print);

    // arr3 after copy: 3 4 0 4 6

    cout << endl;

    swap(*arr1, *(arr1+1));

    cout << "arr3 after swap: ";

    for_each(arr3.begin(), arr3.end(), print);

    // arr3 after swap: 3 4 0 4 6

    cout << endl;

    replace(arr3.begin(), arr3.end(), 4, 7);

    cout << "arr3 after replace: ";

    for_each(arr3.begin(), arr3.end(), print);

    // arr3 after replace: 3 7 0 7 6

    cout << endl;

    fill(arr1, arr1 + 3, 5);

    cout << "arr1 after fill: ";

    for_each(arr3.begin(), arr3.end(), print);

    // arr1 after fill: 3 7 0 7 6

    cout << endl;

    auto newEnd1 = unique(arr3.begin(), arr3.end());

    cout << "arr3 after unique: ";

    for_each(arr3.begin(), newEnd1, print);

    // arr3 after unique: 3 7 0 7 6

    cout << endl;

    auto newEnd2 = remove(arr3.begin(), newEnd1, 7);

    cout << "arr3 after remove 7: ";

    for_each(arr3.begin(), newEnd2 , print);

    // arr3 after remove 7: 3 0 6

    cout << endl;

    cout << "arr2 before reverse: ";

    for_each(arr2.begin(), arr2.end(), print);

    // arr2 before reverse: 0 8 2 4 6

    cout << endl;

    reverse(arr2.begin(), arr2.end());

    cout << "arr2 after reverse: ";

    for_each(arr2.begin(), arr2.end(), print);

    // arr2 after reverse: 6 4 2 8 0

    cout << endl;

    sort(arr2.begin(), arr2.end());

    cout << "arr2 after sort: ";

    for_each(arr2.begin(), arr2.end(), print);

    // arr2 after sort: 0 2 4 6 8

    cout << endl;

    cout << "Min(arr1) = " << *min_element(arr1, arr1 + len) << endl;

    // Min(arr1) = 2

    cout << "Max(arr1) = " << *max_element(arr1, arr1 + len) << endl;

    // Max(arr1) = 5

    return 0;

}