摘要
本文准备在文[1]的基础上提出一种谓之代码转换、分档链接的新排序方法(以下简称分档链接排序法)。给出排序算法、流程图和用C 语言编写程序进行实验的结果。算法分析和实验结果都表明在被排数据均匀分布的情况下,该排序方法的时间复杂性为O(N),附加存储开销为2∈N(其中∈是一个链接场所需的空间大小)。该排序方法不仅在速度上明显快于快速排序法,而且也快于分档插入排序法。
In this paper,a new sorting method by code transforming and graded linking(GL,for
short)is presented and its algorithm,flowcharts and the experimental results are given.The algorithmic
analysis and results of experiment show that in the case of processing uniform-distributed data with
the method of GL,the time complexity shall be O(N),and memory cost shall be 2∈N (∈≤1).The
sorting speed is obviously quicker than that of OUICK SORT or sorting method of code transformation,
graded computing and insertional relocations.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1993年第8期1-5,共5页
Journal of Computer Research and Development
基金
江苏省教委自然科学基金资助
关键词
排序
链接
链接排序法
sorting
sorting method of code-transformation
graded computing and insertional relocations
linking.
