1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
#include <algorithm>
#include <iterator>
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
bool caseString(string const &first, string const &second)
{
return strcasecmp(first.c_str(), second.c_str()) < 0;
}
// to obtain previous permutations change 'next_' to 'prev_'
int main()
{
string saints[] = {"Oh", "when", "the", "saints"};
cout << "All permutations of 'Oh when the saints':\n"
"Sequences:\n";
do
{
copy(saints, saints + 4, ostream_iterator<string>{ cout, " " });
cout << '\n';
}
while (next_permutation(saints, saints + 4, caseString));
cout << "After first sorting the sequence:\n";
sort(saints, saints + 4, caseString);
cout << "Sequences:\n";
do
{
copy(saints, saints + 4, ostream_iterator<string>{ cout, " " });
cout << '\n';
}
while (next_permutation(saints, saints + 4, caseString));
}
// Displays (partially):
// All permutations of 'Oh when the saints':
// Sequences:
// Oh when the saints
// saints Oh the when
// saints Oh when the
// saints the Oh when
// ...
// After first sorting the sequence:
// Sequences:
// Oh saints the when
// Oh saints when the
// Oh the saints when
// Oh the when saints
// ...
|
