计算机应用研究2012，Vol.29Issue(7)：2513-2516,4.DOI:10.3969/j.issn.1001-3695.2012.07.029
一种三路划分快速排序的改进算法
Enhanced algorithm for three-route quick sort
王善坤 1陶祯蓉2
作者信息
- 1. 大连理工大学城市学院网络信息中心,辽宁大连116600
- 2. 四川省计算机研究院,成都610041
- 折叠
摘要
Abstract
Quick sort is a kind of classic sorting method whose average operation stands out. For the low efficiency problem of the quick sort in some special cases( when dealing with ordered or repetitive data) , the algorithm improved the three-way quick sort, so that in special cases, the algorithm still maintainsed good efficiency. Large number of tests show that, in its best sce-nario, this calculating approach is largely superior to the ordinary ones, and in its worst scenario, it equals to the ordinary ones. The improved three-way quick sort is a general and efficient sorting algorithms , so in certain case, it may provide access to more efficiency.关键词
快速排序/平均时间复杂度/三路划分快速排序/算法/排序性能Key words
quick sort/ average time complexity/ three-route quick sort/ algorithm/ efficiency for sorting分类
信息技术与安全科学引用本文复制引用
王善坤,陶祯蓉..一种三路划分快速排序的改进算法[J].计算机应用研究,2012,29(7):2513-2516,4.
