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

0 vote153 views1 answer
How to make a typing effect c++
C++
0 vote157 views1 answer
C++ allocate and free dynamic 2d array
C++
0 vote150 views1 answer
C++ programming
C++
0 vote146 views1 answer
Pause the console c++
C++
35 votes165 views6 answers
Hello world cpp
C++
0 vote159 views1 answer
Display dot product of two Arrays.
C++
0 vote157 views1 answer
The number of ones int bitset
C++
5 votes163 views10 answers
Array
C++
0 vote138 views1 answer
Destin'y child
C++
1 vote175 views1 answer
Detect cycle in an undirected graph
C++