Survey on Algorithms 347, 426, and Quicksort
ACM Transactions on Mathematical Software (TOMS)
Some performance tests of “quicksort” and descendants
Communications of the ACM
Algorithms 402: Increasing the efficiency of quicksort
Communications of the ACM
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
Communications of the ACM
Communications of the ACM
Communications of the ACM
Communications of the ACM
Quicksort algorithms with an early exit for sorted subfiles
CSC '87 Proceedings of the 15th annual conference on Computer Science
Acceleration of sweep-line technique by employing smart quicksort
Information Sciences—Informatics and Computer Science: An International Journal
Technical Correspondence—MEANSORT (April 1983): response from Dalia Motzkin with John Kapenga
Communications of the ACM
| Hi-index | 48.25 |
This paper presents an efficient algorithm based on Quicksort. The Quicksort algorithm is known to be one of the most efficient sorting techniques; however, one of the drawbacks of this method is its worst case situation of 0 (n2) comparisons. The algorithm presented here improves the average behavior of Quicksort and reduces the occurrence of worst case situations.3~