均匀分布数据的分“档”统计插入排序算法研究

被引:22
作者
王向阳
机构
[1] 烟台师范学院数学与计算机科学系!烟台
关键词
sorting; code-transformation; graded computing; insertional relocations;
D O I
暂无
中图分类号
TP311 [程序设计、软件工程];
学科分类号
081202 ; 0835 ;
摘要
A new sorting method, the method of code-transformation, graded computing and insertional relocations is presented. Its algorithm description, time complexity and experimental results in C are given. It's proved by algorithm analysis and ex- perimental results that its time complexity is O(N) and the new sorting algorithm is better than the quick sort etc. when data are in equidistribution.
引用
收藏
页码:187 / 193
页数:7
相关论文
共 4 条
[1]   小间隔数据的地址映射链接排序算法研究 [J].
王向阳 .
小型微型计算机系统, 1999, (11) :846-850
[2]   按位段分块排序法 [J].
唐开山 .
微计算机应用, 1997, (03) :154-157
[3]   分段快速排序法 [J].
唐向阳 .
软件学报, 1993, (02) :53-57
[4]   快速分组排序 [J].
张建中 .
数值计算与计算机应用, 1988, (03) :139-143