基于数据分布特性的快速排序

文中提出了一种基于数据分析特性的快速排序算法，根据被排数据的分布行性，选择数据比较次数和数据移动次数较少的排序算法，当被排数据存在ｍ个有序序列时，其算法的时间复杂度为Ｏ（ｎｌｏｇ２ｍ）其中ｍ∈（１，ｃｆ√ｎ），ｃ为某一常数，其最佳性能为Ｏ（ｎ）。当ｍ≥ｃ（√ｎ）时，保持快速排序的最佳平均性能，使排序运行于较优状态下。

A Quick Sorting Based on Data Distribution

In this paper, a quick sorting method based on data distribution is put forward, selected sorting method of as few data comparisons and move according characteristic of data distribution.The existential m ordered sequences in data,the time complexity of this method is O (nlog2m), herem, c is constant, and its performance is O (n) in the optimal casc .The , keep optimal average performance of Quicksort.