摘要
本文给出一种有限次分组快速排序算法并证明该排序算法处理均匀分布数据记录，正态分布数据记录及一般概率分布数据记录的平均时间复杂性为Ｏ（Ｎ）；给出四种快速排序算法分别关于均匀分布数据记录，正态分布数据记录，均匀波浪式分布数据记录和异常分布数据记录，进行排序的实验结果。
In this paper, a finite grading sorting algorithm is given. For given N data recordings of mean, normal and common distribution, the expected time complexity of this algorithm is O(N). The experiment results from mean distribution data recordings, normal distribution data recordings and two other distribution data recordings with four sorting algorithms on IBM PC386 SX are given, which demonstrate the finite grading sorting algorithm can ran more efficiently than other famous sorting algorithms.
出处
《青岛大学学报（自然科学版）》
CAS
1999年第1期9-14,共6页
Journal of Qingdao University(Natural Science Edition)
关键词
分组排序算法
时间复杂性
程序设计
排序算法
quick sorting algorithm
grading sorting algorithm
probability distribution
time complexity
