python all permutations of a string
>>> from itertools import permutations
>>> perms = [''.join(p) for p in permutations('stack')]
>>> permspython all permutations of a string
>>> from itertools import permutations
>>> perms = [''.join(p) for p in permutations('stack')]
>>> permshow to get all permutations of an array
/* to be used something like this:
int [] toBePermuted = new int [] {1, 2, 3, 4};
ArrayList<int[]> a = heap(toBePermuted);
any mention of int [] can be replaced with any other Array of objects */
ArrayList<int []> heap(int [] input) {
ArrayList<int []> ret = new ArrayList<int []> ();
ret = generate(input.length, input, ret);
return ret;
}
ArrayList<int []> generate(int k, int [] a, ArrayList<int []> output) {
if (k == 1) {
output.add(a.clone());
} else {
output = generate(k-1, a, output);
for (int i=0; i<k-1; i++) {
if (k%2 == 0) {
int temp = a[i];
a[i] = a[k-1];
a[k-1] = temp;
} else {
int temp = a[0];
a[0] = a[k-1];
a[k-1] = temp;
}
generate(k-1, a, output);
}
}
return output;
}find all permutations of a string
void permute(string a, int l, int r)
{
// Base case
if (l == r)
cout<<a<<endl;
else
{
// Permutations made
for (int i = l; i <= r; i++)
{
// Swapping done
swap(a[l], a[i]);
// Recursion called
permute(a, l+1, r);
//backtrack
swap(a[l], a[i]);
}
}
}generate all permutations of string
void perm(char a[], int level){
static int flag[10] = {0};
static char res[10];
// If we are the last character of the input string
if(a[level] == '\0'){
// First we assign stopping point to result
res[level] = '\0';
// Now we print everything
for(int i = 0; res[i] != '\0'; ++i){
printf("%c", res[i]);
}
printf("\n");
++counter;
}
else{
// Scan the original string and flag to see what letters are available
for(int i = 0; a[i] != '\0'; ++i){
if(flag[i] == 0){
res[level] = a[i];
flag[i] = 1;
perm(a, level + 1);
flag[i] = 0;
}
}
}
}
int main(){
char first[] = "abc";
perm(first, 0);
return 0;
}how to print all permutations of a string
void permutation(string s)
{
sort(s.begin(),s.end());
do{
cout << s << " ";
}
while(next_permutation(s.begin(),s.end()); // std::next_permutation
cout << endl;
}find all permutations of a string
ABC
ACB
BAC
BCA
CBA
CABCopyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
