基于分治和递归策略的排序算法及实现  

Sorting algorithm based on divide-and-conquer strategy and recursive strategy and its realization

作　　者：孙义欣[1] 

机构地区：[1]潍坊工程职业学院继续教育学院,山东青州262500

出　　处：《计算机时代》2012年第1期27-28,30,共3页Computer Era

摘　　要：对关键字数量远少于记录数量的排序问题进行了研究,提出了基于分治和递归策略的有效算法。经与选择排序算法比较,该算法在各种情况下的交换次数均明显少于经典的选择排序算法。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.

关 键 词：排序 关键字 分治 递归 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]