Question: Print all the permutations of a string. Write code in C.

Answer: Here is a recursive solution to print all the permutations of a string. However, this solution does not take care of duplicates. It is assumed that there are no duplicates in the string. I left out the implementation of the swap method since that implementation is not important here.

The idea is to keep the first character constant and generate permutations with the rest. Then keep the first two characters constant and generate permutations with the rest until you are out of characters 🙂

void permutate( char[] str, int index ) { int i = 0; if( index == strlen(str) ) { // We have a permutation so print it printf(str); return; } for( i = index; i < strlen(str); i++ ) { swap( str[index], str[i] ); // It doesn't matter how you swap. permutate( str, index + 1 ); swap( str[index], str[i] ); } }

permutate( "abcdefgh", 0 );

Now what do we do if there are duplicates in the string? The trick is to sort the characters in the alphabetical order first. We can then ignore the duplicates easily when generate the permutation.

void permutate( char[] str, int index ) { int i = 0; static lastChar = 0; if( index == strlen(str) ) { // We have a permutation so print it printf(str); return; } // Permutate once without any swaps. permutate( str, index + 1 ); lastChar = str[index]; for( i = index + 1; i < strlen(str); i++ ) { if( lastChar == str[i] ) { continue; } else { lastChar = str[i]; } swap( str[index], str[i] ); // It doesn't matter how you swap. permutate( str, index + 1 ); swap( str[index], str[i] ); } }

permutate( sort("Hello World"), 0 );

Simple right? Any comments or suggestions are always welcome.

Like this post? Please Digg it or Stumble it.