-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquestion6.cpp
More file actions
69 lines (69 loc) · 1.32 KB
/
question6.cpp
File metadata and controls
69 lines (69 loc) · 1.32 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
67
68
69
#include<iostream>
using namespace std;
int ix=0;
int s;
void printNextPermute(string list[10000],int idx)
{
for(int i=0;i<idx-1;i++)
{
for(int j=0;j<idx-i-1;j++)
{
if(list[j]>list[j+1])
{
string t=list[j];
list[j]=list[j+1];
list[j+1]=t;
}
}
}
for(int i=0;i<idx;i++)
{
if(list[i].length()==0)
{
continue;
}
cout<<list[i]<<endl;
}
return;
}
void permute(string str,int start,string list[10000])
{
if(str[start]=='\0')
{
list[ix]=str;
ix++;
return;
}
for(int i=start;i<str.length();i++)
{
swap(str[i],str[start]);
permute(str,start+1,list);
swap(str[i],str[start]);
}
return;
}
void combination(string key,string output,string list[10000])
{
if(key.length()==0)
{
permute(output,0,list);
return;
}
combination(key.substr(1),output,list);
combination(key.substr(1),output+key[0],list);
return;
}
int main()
{
string key;
string output;
string list[10000];
cout<<endl<<"Name - Daksh Gupta"<<endl;
cout<<"Roll no. - 2019UCO1669"<<endl<<endl;
cout<<"Enter the keyword:\n";
cin>>key;
combination(key,output,list);
cout<<"All the possible combinations are:\n";
printNextPermute(list,ix);
return 0;
}