Thumbnail
Access Restriction
Subscribed

Author Motzkin, Dalia
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Efficient sorting ♦ Quicksort
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 (n2) comparisons. The algorithm presented here improves the average behavior of Quicksort and reduces the occurrence of worst case situations.3~
Description Affiliation: Western Michigan Univ., Kalamazoo (Motzkin, Dalia)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 26
Issue Number 4
Page Count 2
Starting Page 250
Ending Page 251


Open content in new tab

   Open content in new tab
Source: ACM Digital Library