摘要
通过对数字递增排序进行分析,提出了一种可以按序求解全排列的非递归算法,并进行了数学分析.该算法比传统的递归算法有更高的效率和更低的空间复杂度,可以简化一些穷举问题的求解过程.
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.
出处
《山西大同大学学报（自然科学版）》
2013年第6期9-11,共3页
Journal of Shanxi Datong University(Natural Science Edition)
关键词
全排列
递增排序
顺序解
穷举问题
full permutation
ascending sort
ordinal solution
exhaustive problem
