[Algorithm] full permutation class problem

The result of a full arrangement of three characters for ABC is ABC,ACB,BAC,BCA,CAB,CBA. A realization idea can be described as follows: Step1, determines the first bit of the character, can be a, B or C. Step2, after the first character is determined, the remaining characters are perfection arranged.

The C + + implementation is as follows:

voidPermutation (Char* Chars,Char*begin) {    if(*begin==' /') {cout<< chars <<Endl; return; }     for(Char* p=begin;*p!=' /';p + +)    {        inttemp=*p; The first character can be, A, B, or C.        implemented by swapping. *p=*begin; *begin=temp; Permutation (Chars,begin+1);        Perfection the rest of the characters. Temp=*p; Recovery*p=*begin; *begin=temp; }}

Note that the final code, which is three lines of code, restores the results of an arrangement to before the arrangement.

[Algorithm] full permutation class problem