Year: 1983
Type: article
Abstract: 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 (n 2 ) comparisons. The algorithm presented here improves the average behavior of Quicksort and reduces the occurrence of worst case situations.
Source: Communications of the ACM
DOI: 10.1145/2163.358088
Author: Dalia Motzkin
Institution: Western Michigan University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2339840635
