Сортування

Перестановки

#include<iostream>

#include<algorithm>

#include<vector>

using namespace std;

int i,j,n;

int main()

{cin>>n;

vector<int> a(n);

for (int i=0;i<n;i++) cin>>a[i];

sort(a.begin(),a.end());

for (i=0; i<n-1; i++) cout<<a[i]<<" ";

cout<<a[n-1]<<"\n";

 return 0;

}

#include<iostream>

#include<algorithm>

#include<vector>

using namespace std;

vector<int> a;

int n;

int main()

{cin>>n;

for (int i=1;i<=n;i++) a.push_back(i);

for (int i=0; i<n-1; i++) cout<<a[i]<<" ";

cout<<a[n-1]<<"\n";

 while (next_permutation(a.begin(),a.end()))

{for (int i=0;i<n-1;i++)cout << a[i] << " ";

  cout<<a[n-1]<<"\n";

}

 return 0;

}