The Improved Algorithm on the Quicksort
Yulin Zhou · 2001
In this paper we improved the quicksort algorithm. on the basic of the character: when the list is mainly in order, the insertion sort algorithm has a good performance, in our improved algorithm we recur quicksort on the sublist only when the length of it is larger than the value k, and after all recurrences we sort the whole list by insertion sort, by this way we obtain a improved algorithm in which the average-case time-complexity is2nln(n/k)+nk/4-3(n+1)/(k+1)+O(lnn),when we let k nearly 8, the quality of improved algorithm is the best .