Recursive thinking achieves full Arrangement

[Cpp]
# Include <stdio. h>
 
Int Swap (char * a, char * B)
{
Char c;
C = *;
* A = * B;
* B = c;
}
 
/*
* Recursive thinking achieves full Arrangement
* If abc is fully arranged, we can see that AB is fully arranged + c and ac + B and bc + a combination.
*/
Void Perm (char * list, int k)
{
// Arrange the substrings after k in the list Array
Int I;
If ('\ 0' = list [k]) {// output an arrangement
Printf ("% s \ t", list );
Putchar ('\ n ');
}
Else
{
For (I = k; list [I]! = '\ 0'; I ++ ){
Swap (& list [k], & list [I]);
Perm (list, k + 1); // arrange the right substring in full
 
Swap (& list [k], & list [I]);
}
}
}
 
Int main (int argc, char * argv [])
{
Char string [10] = "123 ";
Perm (string, 0 );
Return 0;
}