#include <iostream>
#include <algorithm>
using namespace std;
int main (void)
{
int iArray[] = {1, 2, 3, 4, 5, 6};
sort(iArray,iArray+6);
do
{
cout << iArray[0] << " " << iArray[1] << " " << iArray[2] << " "
<< iArray[3] << " " << iArray[4] << " " << iArray[5] << endl;
}while (next_permutation(iArray,iArray+6));
return 0;
}
#include <iostream>
#include <algorithm>
#include <conio.h>
using namespace std;
bool cmp(const int &a, const int &b)
{
return a>b;
}
int main (void)
{
int iArray[] = {1, 2, 3, 4, 5, 6};
sort(iArray,iArray+6,cmp);
do
{
cout << iArray[0] << " " << iArray[1] << " " << iArray[2] << " "
<< iArray[3] << " " << iArray[4] << " " << iArray[5] << endl;
}while (prev_permutation(iArray,iArray+6));
return 0;
}