Recursive Algorithm for output in full Arrangement

When I click Weibo in the morning, I can see all the input via the program. If I find that I haven't written it, I can't. Check the information.
The explanation on Baidu encyclopedia is to replace the current Index with the subsequent Index until the end!

// Convert the specified subscript in the array to private static void (char [] charlist, int left, int right) {var m = charlist [left]; charlist [left] = charlist [right]; charlist [right] = m;} private static void recursion (char [] charlist, int index, int length) {if (index = length-1) // output the current order at the end of the access list {for (int I = 0; I <charlist. length; I ++) {Console. write (charlist [I]);} Console. writeLine ();} else {// access list for (int I = inde X; I <length; I ++) {if (I! = Index) {Exchange (charlist, index, I);} recursion (charlist, index + 1, length); if (I! = Index) {Switch (charlist, index, I );}}}}