Q. Let given values are 1,2,3.
The permutations are
123
132
213
231
312
321
Source Code is:-
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
vector<char> v;
int n;
char num;
cout<<"\n Emter N::";
cin>>n;
cout<<"\n Enter Elements:";
for(int i=0;i<n;i++)
{
cin>>num;
v.push_back(num);
}
cout<<"\n Elements Are::";
for(int i=0;i<v.size();i++)
cout<<" "<<v[i];
cout<<"\n Permutations Are\n";
do
{
for(int i=0;i<v.size();i++)
{ if(i%5==0)
cout<<"\n";
cout<<" "<<v[i];
}
cout<<"\t";
}while(next_permutation(v.begin(),v.end()));
return 0;
}
The permutations are
123
132
213
231
312
321
Source Code is:-
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
vector<char> v;
int n;
char num;
cout<<"\n Emter N::";
cin>>n;
cout<<"\n Enter Elements:";
for(int i=0;i<n;i++)
{
cin>>num;
v.push_back(num);
}
cout<<"\n Elements Are::";
for(int i=0;i<v.size();i++)
cout<<" "<<v[i];
cout<<"\n Permutations Are\n";
do
{
for(int i=0;i<v.size();i++)
{ if(i%5==0)
cout<<"\n";
cout<<" "<<v[i];
}
cout<<"\t";
}while(next_permutation(v.begin(),v.end()));
return 0;
}
No comments:
Post a Comment