| 全排列顺序解的非递归算法 |
| |
| 引用本文： | 白宇.全排列顺序解的非递归算法[J].山西大同大学学报（自然科学版）,2013(6):9-11. |
| |
| 作者姓名： | 白宇 |
| |
| 作者单位： | 山西大同大学数学与计算机科学学院,山西大同037009 |
| |
| 摘 要： | 通过对数字递增排序进行分析，提出了一种可以按序求解全排列的非递归算法，并进行了数学分析．该算法比传统的递归算法有更高的效率和更低的空间复杂度，可以简化一些穷举问题的求解过程．
|
| 关 键 词： | 全排列 递增排序 顺序解 穷举问题 |
Non-recursive Algorithm of Full Permutation Ordinal Solution |
| |
| BAI Yu.Non-recursive Algorithm of Full Permutation Ordinal Solution[J].Journal of Shanxi Datong University(Natural Science Edition),2013(6):9-11. |
| |
| Authors: | BAI Yu |
| |
| Institution: | BAI Yu (School of Mathematics ＆ Computer Science, Shanxi Datong University, Datong Shanxi, 037009) |
| |
| Abstract: | Analyzed by ascending sort of digital, this paper designed non-recursive algorithm of ordinal solving the full permu- tation, and its mathematical analysis. The algorithm has higher efficiency and lower space complexity than conventional recursive al- gorithms, it can simplify the solution procedure for exhaustive problem. |
| |
| Keywords: | full permutation ascending sort ordinal solution exhaustive problem |
| 本文献已被 维普 等数据库收录！ |
