C++ Programming Code Examples C++ > Sorting Searching Code Examples Program to Permute All Letters of an Input String Program to Permute All Letters of an Input String - This algorithm print the permutation of a string with all distinct characters. - The time complexity of this algorithm is O(n!). - This algorithm takes the input of a string with all distinct characters N value. - It places each character to every index by swapping values. - After each completion calls again the between those indexes to regain the earlier stage. - Exit. #include<iostream> #include<string.h> using namespace std; // A function to swap character values of the string using references. void swap (char *x, char *y) { char temp; temp = *x; *x = *y; *y = temp; } // A function to print permutation using recursion technique. void Permute(char *a, int i, int n) { int j; if (i == n-1) cout<<"\n"<<a; else { for (j = i; j < n; j++) { // Swap the character at ith index with every other value to get all the possible permutations. swap(a[i], a[j]); Permute(a, i + 1, n); swap(a[i], a[j]); } } } int main() { char str[21]; int len, count = 1; cout<<"\nEnter a string: "; cin>>str; len = strlen(str); for (i = 0; i < N; i++) { count *= (i+1); } // Print the permutation's count. cout<<"\nThe number of permutations possible is: "<<count; // Call permute() function to print all the permutation. Permute(str, 0, len); return 0; }
