-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpermutations.cpp
More file actions
66 lines (47 loc) · 1.28 KB
/
permutations.cpp
File metadata and controls
66 lines (47 loc) · 1.28 KB
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include<iostream>
#include<vector>
using namespace std;
void permutationsHelp(int i,vector<int>*array,vector<vector<int>> *permutations);
void swap(vector<int>*array,int i ,int j);
vector<vector<int>>getpermutations(vector<int>array){
vector<vector<int>>permutations;
permutationsHelp(0,&array,&permutations);
return permutations;
}
void permutationsHelp(int i,vector<int>*array,vector<vector<int>> *permutations){
if(i==array->size()-1)
{
permutations->push_back(*array);
}else{
for(int j=i;j<array->size();j++){
swap(array,i,j);
permutationsHelp(i+1 ,array,permutations);
swap(array,i,j);
}
}
}
void swap(vector<int>*array,int i,int j){
int temp=array->at(i);
array->at(i)=array->at(j);
array->at(j)=temp;
}
int main(){
vector<int>array;
int i;
cin>>i;
for(int z=0;z<i;z++)
{
int data;
cin>>data;
array.push_back(data);
}
vector<vector<int>>permutation = getpermutations(array);
for(int i=0;i<permutation.size();i++)
{
for(int j=0;j<permutation[i].size();j++){
cout<<permutation[i][j]<<" ";
}
cout<<endl;
}
return 0;
}