按字节桶分配链接排序法  

A SORTING METHOD ACCORDING BUCKET NUMBER OF BYTE CODE TO DISTRIBUTION AND LINKING

作　　者：杨大顺[1] 陶明华[1] 顾芸瑛[1] 薛峰[1] 

机构地区：[1]镇江师范专科学校,华东船舶工业学院

出　　处：《计算机研究与发展》1996年第2期132-139,共8页Journal of Computer Research and Development

基　　金：江苏省教委自然科学基金

摘　　要：本文准备提出一种谓之按字节桶分配链接的新排序方法。给出排序算法、流程图和用Ｃ语言编写程序进行实验的结果。算法分析和实验结果都表明，该排序方法的时间复杂性为Ｏ（Ｎ）且与数据的分布情况无关，附加存储开销为（Ｎ＋５１２）ε（其中ε是一个键接场所需空间的大小）［１］。该排序方法不仅在速度上明显快于快速排序法，而且在非均匀分布数据的情况下也明显快于桶排序法。In this paper, a new sorting method which accords bucket number of bytecode to distribution and linking is put forward, and its sorting algorithm,its flowchartsand its experimental results in C-language are also given. The algorithmic analysis andexperimental results show that the time eomplexity of this method is O(N) and it hasnothing to do with data distribution. Addi-nonal memory cost is (N+512)ε (εis thesize of needed space of linking field)[1]. The method is not only obviously quicker thanthat of quick sort, but also much quicker than the bucket sorting method,even in thecase of non-uniformly distributed data.

关 键 词：排序 桶排序 链接排序 字节 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]