定名次快速排序方法  

Ranking Rapid Sorting Method

作　　者：何洪英[1] 陈友军[1] 

机构地区：[1]西华师范大学数学与信息学院,四川南充637002

出　　处：《智能计算机与应用》2012年第6期52-53,共2页Intelligent Computer and Applications

基　　金：四川省教育厅青年基金项目(10ZB018)

摘　　要：给出了一个全新的不用比较交换数据的排序法—定名次排序法。用于内排序其计算量为2N次加法;对于涉及M个文件的外排序,可不形成新文件,计算量为N次加法,调用文件次数为2M次。该算法也是一特殊的并行算法,其总计算量几乎和单机计算量相同。This paper gives a new sorting method that does not need to compare and exchange data——Fixed placing sorting method.Its calculating amounts is 2N times addition for internal sorting.For external sorting related to the M files,it will not generate new files,and its calculating amounts is N times addition,simultaneously needs call files 2M times.This algorithm is also a particular parallel algorithm.Its total calculating amounts is nearly same as that of single user.

关 键 词：排序 比较交换 算法复杂性 并行算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]