how to 'group' an array by STL ?

[William]

for example, there is an array: int a[]={2, 3, 1,3, 2,1};
i want to group it as: {2,2,3,3,1,1} , not care the order.

i can use std::sort( &a[0], &a[len-1]);
but this will also sort the array which will get less performance than
group.

how to do this by STL ? thanks

 

[=?iso-8859-1?q?Erik_Wikstr=F6m?=]

for example, there is an array: int a[]={2, 3, 1,3, 2,1};
i want to group it as: {2,2,3,3,1,1} , not care the order.

i can use std::sort( &a[0], &a[len-1]);
but this will also sort the array which will get less performance than
group.

You probably want the partition algorithm, take a look at
http://www.cppreference.com/cppalgorithm/partition.html for more info.

 

[Ondra Holub]

William napsal:

for example, there is an array: int a[]={2, 3, 1,3, 2,1};
i want to group it as: {2,2,3,3,1,1} , not care the order.

i can use std::sort( &a[0], &a[len-1]);
but this will also sort the array which will get less performance than
group.

how to do this by STL ? thanks

You can do something like:

int* from = &a[0];
while (from != &a[LEN])
from = std:artition(from + 1, &a[LEN],
std::bind1st(std::equal_to<int>(), *from));

But I do not think you will gain better performance than with std::sort.