Ranking Rapid Sorting Method
Chen You-jun · Intelligent Computer and Applications · 2012
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.