摘要
本文提出了一种新的排序方法——数轴分段排序(ASS)算法,此方法彻底抛弃了传统排序算法对数据的反复比较和交换两种操作,以数据值同空间的对应关系完成其排序过程。其排序运算量为O(n),达到了排序运算量的下限。本文通过对ASS算法的复杂性分析,提出了一些有效的改进意见,指出对分法是ASS算法的特例,并推荐了不同数据条件下宜采用的排序方法。
The ASS algorithm is a new sorting method given by the author 1990. With this method, which is totally freed from the two kinds of traditional operations——repeated comparing and exchanging of data, the process of sorting can be
accomplished based on the corresponding relation between the data and the space. Its sorting number of operation times O (n) has reached the lower bound of sorting operation. In this paper, the computational complexity of ASS algorithm is analyzed, and some effective improvements are advanced. It is pointed out that halving is a special case for ASS. Some proper sorting methods to be taken under different data condition are recommended.
出处
《计算机应用与软件》
CSCD
1996年第4期17-22,共6页
Computer Applications and Software
关键词
数轴分段排序
算法
排序
复杂性
Axis Segmenting Sorting (ASS) algorithm, sorting, computational complexity, the number of operation times.
