概率统计分“档”快速排序算法  

A new algorithm for statistical classification and quick sorting

作　　者：黄思先[1] 

机构地区：[1]福建农林大学计算机与信息学院,福建福州350002

出　　处：《福建农林大学学报（自然科学版）》2003年第3期370-374,共5页Journal of Fujian Agriculture and Forestry University:Natural Science Edition

基　　金：福建省教育厅基金资助项目(JA01033).

摘　　要：提出了给定待排数据概率分布函数情况下的概率统计分"档"快速排序算法.理论分析表明该算法时间复杂度仅为O(n).以指数分布情况为例,用Delphi编程进行排序实验,结果表明该算法时间复杂度为O(n).Under the condition of given data statistical distribution, a new algorithm for statistical classification and quick sorting was implemented. Its algorithm description, time complexity and experimental results in Delphi were given. It was proved by algorithm analysis that its time complexity was O(n). With exponential distribution data as an example, the result indicated its time complexity was O(n).

关 键 词：概率统计分“档” 快速排序算法 DELPHI编程 时间复杂度 计算机科学 

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