Partition in STL using vector

// C++ code to demonstrate the working of
// partition() and is_partitioned()
#include<iostream>
#include<algorithm> // for partition algorithm
#include<vector> // for vector
using namespace std;
int main()
{
    // Initializing vector
    vector<int> vect = { 2, 1, 5, 6, 8, 7 };
     
    // Checking if vector is partitioned
    // using is_partitioned()
    is_partitioned(vect.begin(), vect.end(), [](int x)
    {
        return x%2==0;
         
    })?
     
    cout << "Vector is partitioned":
    cout << "Vector is not partitioned";
    cout << endl;
     
    // partitioning vector using partition()
    partition(vect.begin(), vect.end(), [](int x)
    {
        return x%2==0;
         
    });
     
    // Checking if vector is partitioned
    // using is_partitioned()
    is_partitioned(vect.begin(), vect.end(), [](int x)
    {
        return x%2==0;
         
    })?
     
    cout << "Now, vector is partitioned after partition operation":
    cout << "Vector is still not partitioned after partition operation";
    cout << endl;
     
    // Displaying partitioned Vector
    cout << "The partitioned vector is : ";
    for (int &x : vect) cout << x << " ";
     
    return 0;
     
}

Source: geeksforgeeks.org

Similar codes

1 vote146 views1 answer
C++ milliseconds
C++
3 votes120 views4 answers
C++ char array size
C++
0 vote112 views3 answers
C++ loop through list
C++
-2 votes120 views2 answers
C++ for
C++
0 vote118 views1 answer
How to slice vector in c++
C++
0 vote108 views1 answer
C++ vector declaration
C++
30 votes80 views10 answers
While loop c++
C++
0 vote63 views1 answer
Getting int command line arguments c++
C++
0 vote125 views1 answer
How to write int variable c++
C++
12 votes118 views1 answer
How to sort in descending order c++
C++