%0 Journal Article
%T Enhanced algorithm for three-route quick sort<br>一种三路划分快速排序的改进算法
%A WANG Shan-kun
%A TAO Zhen-rong
%A <br>王善坤
%A 陶祯蓉
%J 计算机应用研究
%D 2012
%I 
%X 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 caseswhen 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 scenario, 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.
%K quick sort
%K average time complexity
%K three-route quick sort
%K algorithm
%K efficiency for sorting<br>快速排序
%K 平均时间复杂度
%K 三路划分快速排序
%K 算法
%K 排序性能
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=317801168408847822F3F0D76908E6BB&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=DF92D298D3FF1E6E&sid=75359DB37CA6AEF5&eid=71E51BD3D819EC5A&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11