全排列的生成算法就是对于给定的字符集，用有效的方法将所有可能的全排列无重复无遗漏地枚举出来。任何n个字符集的排列都可以与1～n的n个数字的排列一一对应，因此在此就以n个数字的排列为例说明排列的生成法。

-The generation algorithm is the full array for a given character set, using an effective method of the full array of all possible non-repeating non-exhaustive enumeration of them. Any arrangement of n-character set can be with 1 ~ n n-numbers are arranged one correspondence, so in this respect to the arrangement of n numbers ordered as examples generate the method.