| 基于分治和递归策略的排序算法及实现 |
| |
| 引用本文： | 孙义欣. 基于分治和递归策略的排序算法及实现[J]. 计算机时代, 2012, 0(1): 27-28,30 |
| |
| 作者姓名： | 孙义欣 |
| |
| 作者单位： | 潍坊工程职业学院继续教育学院,山东青州,262500 |
| |
| 摘 要： | 对关键字数量远少于记录数量的排序问题进行了研究,提出了基于分治和递归策略的有效算法。经与选择排序算法比较,该算法在各种情况下的交换次数均明显少于经典的选择排序算法。
|
| 关 键 词： | 排序 关键字 分治 递归 |
Sorting algorithm based on divide-and-conquer strategy and recursive strategy and its realization |
| |
| Sun Yixin. Sorting algorithm based on divide-and-conquer strategy and recursive strategy and its realization[J]. Computer Era, 2012, 0(1): 27-28,30 |
| |
| Authors: | Sun Yixin |
| |
| Affiliation: | Sun Yixin(College of Further Education,Weifang Engineering Vocational College,Qingzhou,Shandong 262500,China) |
| |
| Abstract: | The sorting problem for the number of keywords far less than that of records is researched,and an effective algorithm based on divide-and-conquer and recursive strategies is put forward.Compared with selection sorting algorithm,the exchanging frequency of this algorithm is obviously less than that of classic selection sorting algorithm under various circumstances. |
| |
| Keywords: | sorting keyword divide and conquer recursion |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
