问题描述：全排列是将一组数按一定顺序进行排列，如果这组数有n个，那么全排列数有n！个。在程序设计过程中，我们往往要对一个序列进行全排列或者对每一个排列进行分析。全排列算法便是用于产生全排列或者逐个构造全排列的方法。当然，全排列算法不仅仅止于全排列，对于普通的排列，或者组合的问题，也可以解决。-Problem Descr iption: Full array is a set of numbers arranged in a certain order, if there are n number of this group, then the whole number of permutations with n! Months. In the program design process, we often have to arrange for a full sequence or for each permutation analysis. Full alignment algorithm is used to generate the full array or individually constructed full array approach. Of course, the whole alignment algorithm is not only limited to the full array, for ordinary arrangement, or a combination of problems can be resolved.