| 遍历从N个相异元素中取M个元素可能排列的新算法 |
| |
| 引用本文： | 傅克慎. 遍历从N个相异元素中取M个元素可能排列的新算法[J]. 烟台大学学报(自然科学与工程版), 2004, 17(2): 98-100,151 |
| |
| 作者姓名： | 傅克慎 |
| |
| 作者单位： | 烟台大学,数学与信息科学系,山东,烟台,264005 |
| |
| 摘 要： | 给出了遍历从N个相异元素中取M个(N≥M)元素可能排列的新算法．新算法中放弃了首先将全部可能节点进行字典排序，然后按序逐个生成的传统思想，实现了每进行一次数据交换即产生一个新节点，从而极大地提高了遍历的效率。
|
| 关 键 词： | 遍历 算法 排列 复杂性分析 相异元素 |
| 文章编号： | 1004-8820(2004)02-0098-03 |
A New Method to Search for All Over the Possible Permutations of N Different Elements |
| |
| FU Ke-shen. A New Method to Search for All Over the Possible Permutations of N Different Elements[J]. Journal of Yantai University(Natural Science and Engineering edirion), 2004, 17(2): 98-100,151 |
| |
| Authors: | FU Ke-shen |
| |
| Abstract: | 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. |
| |
| Keywords: | algorithm permutation analysess of complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
