遍历从N个相异元素中取M个元素可能排列的新算法

A New Method to Search for All Over the Possible Permutations of N Different Elements

给出了遍历从N个相异元素中取M个(N≥M)元素可能排列的新算法.新算法中放弃了首先将全部可能节点进行字典排序,然后按序逐个生成的传统思想,实现了每进行一次数据交换即产生一个新节点,从而极大地提高了遍历的效率.

A new method to search for all over the possible permutations of N different elements is given. This method abandons the corresponding traditional idea, according to it one must arrange the all possible knots in alphabetical order first, and then visit all knots in order. However, our new method showing us to visit a new knot whenever the data is exchanged, so the efficiency is promoted greatly.