datastructure-and-algorithm/Algorithm/Backtracking/stringPermutation at master · codeshef/datastructure-and-algorithm · GitHub

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
// program to print all permutations

#include<iostream>
#include<string.h>
using namespace std;


void swap(char*x,char*y){

     char temp;
     temp =*x;
     *x =*y;
     *y = temp;
}


void permute(char*a,int l,int r){


  if(l==r)
  cout<<a<<endl;
  else{

    for(int i=l;i<=r;i++){


      swap(a+l,a+i);
      permute(a,l+1,r);
      swap(a+l,a+i); //backtrack

         }

   }

}

int main(){

   char str[] = "ABC";
   int n = strlen(str);
   permute(str,0,n-1);
    return 0;

}