摘要
对关键字数量远少于记录数量的排序问题进行了研究,提出了基于分治和递归策略的有效算法。经与选择排序算法比较,该算法在各种情况下的交换次数均明显少于经典的选择排序算法。
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.
出处
《计算机时代》
2012年第1期27-28,30,共3页
Computer Era
关键词
排序
关键字
分治
递归
sorting
keyword
divide and conquer
recursion
