PHP-Fusion Powered Website - Articles: stable

Users Online

· Guests Online: 37

· Members Online: 0

· Total Members: 188
· Newest Member: meenachowdary055

Forum Threads

Newest Threads

No Threads created

Hottest Threads

No Threads created

Latest Articles

· Do while loop
· The for loop in C
· C while loop
· Pointers in C
· Functions in C

Oh no! Where's the JavaScript?
Your Web browser does not have JavaScript enabled or does not support JavaScript. Please enable JavaScript on your Web browser to properly view this Web site,
or upgrade to a Web browser that does support JavaScript; Firefox, Safari, Opera, Chrome or a version of Internet Explorer newer then version 6.

Articles Hierarchy

Articles Home » C++ » stable_partition() Algorithm in C++

stable_partition() Algorithm in C++

This C++ program rearranges the container elements using stable_partition() algorithm. The algorithm rearranges the elements of the container such that the elements for which predicate returns true precede the elements for which the predicate returns false. The relative order of the elements is preserved.

Here is the source code of the C++ program which rearranges the container elements using stable_partition() algorithm. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C++ Program to rearrange container elements using stable_partition() algorithm

```
 */
```
```
#include <iostream>
```
```
#include <vector>
```
```
#include <algorithm>
```
```
using namespace std;
```
```
 
```
```
bool isGreaterThanFive(int i)
```
```
{
```
```
    return i > 5;
```
```
}
```
```
 
```
```
int main() {
```

    vector<int> v = {5, 1, 6, 2, 4, 3, 9, 8, 10, 7};

```
    vector<int>::iterator it;
```
```
 
```
```
    cout << "Vector : ";
```

    for(vector<int>::iterator i = v.begin(); i != v.end(); i++)

```
        cout << *i << " ";
```
```
    cout << "\n";
```
```
 
```

    it = stable_partition(v.begin(), v.end(), isGreaterThanFive);

    cout << "Elements greater than 5 : ";

    for(vector<int>::iterator i = v.begin(); i != it; i++)

```
        cout << *i << " ";
```
```
    cout << "\n";
```
```
 
```

    cout << "Elements less than or equal to 5 : ";

    for(vector<int>::iterator i = it; i != v.end(); i++)

```
        cout << *i << " ";
```
```
    cout << "\n";
```
```
}
```

$ gcc test.cpp
$ a.out
Vector : 5 1 6 2 4 3 9 8 10 7 
Elements greater than 5 : 6 9 8 10 7 
Elements less than or equal to 5 : 5 1 2 4 3

Users Online

Forum Threads

Latest Articles

Articles Hierarchy

stable_partition() Algorithm in C++

stable_partition() Algorithm in C++

Comments

Post Comment

Ratings