Use stable_partition algorithms: preserving relative order in each group : stable_partition « STL Algorithms Modifying sequence operations « C++

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » STL Algorithms Modifying sequence operations » stable_partitionScreenshots 
Use stable_partition algorithms: preserving relative order in each group
 
 


#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <iterator>
using namespace std;

bool above40(int n) { return (n > 4)}

int main()
{
  const int N = 7;
  int array0[N{5317642};
  int array1[N];

  copy(&array0[0], &array0[N], &array1[0]);

  ostream_iterator<int> out(cout, " ");

  cout << "Original sequence:                 ";
  copy(&array1[0], &array1[N], out); cout << endl;

  // Partition array1, putting numbers greater than 4
  // first, followed by those less than or equal to 4,
  // preserving relative order in each group:
  int* split = stable_partition(&array1[0], &array1[N], above40);

  cout << "Result of stable partitioning:     ";
  copy(&array1[0], split, out); cout << "| ";
  copy(split, &array1[N], out); cout << endl;
  return 0;
}

/* 
Original sequence:                 5 3 1 7 6 4 2
Result of stable partitioning:     5 7 6 | 3 1 4 2
 */        
  
Related examples in the same category
1.Use stable_partition and partition
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.