利用邻位互换法生成n个数字的所有n!个排列。给出正整数n，则1到n这n个数可以构成n!个排列。排列的邻位互换法是所有n!个排列的一种次序，使得每两个相邻的排列都只有相邻的两个数发生了位置互换。-Generating n digital ortho exchange method utilizing all n! Permutations. Given a positive integer n, then n numbers　1 to n which may constitute n! Permutations. Ortho arrangement swap method is that all n! Order of the units of one kind, are arranged such that each two adjacent positions are interchanged only two adjacent numbers occurred.