【摘要】 提出了给定待排数据概率分布函数情况下的概率统计分"档"快速排序算法.理论分析表明该算法时间复杂度仅为O(n).以指数分布情况为例,用Delphi编程进行排序实验,结果表明该算法时间复杂度为O(n).更多还原

【Abstract】 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).更多还原