Concepts
Quicksort
Also Known As Partition-Exchange Sort
Algorithm
Citation Formats
General Reference
APA Style
BibTeX
Quicksort is an efficient general purpose sorting algorithm developed in 1959 by Tony Hoare while he was a visiting student at Moscow State University. It works by choosing a pivot element, partitioning the rest into items smaller and larger than the pivot, and sorting the two parts recursively; on average it takes O(n log n) comparisons to sort n items, and for decades it has been the practical sorting workhorse of standard libraries.
Facts
Core PrinciplePick a pivot, split everything else into smaller and larger, and sort each side the same way; the recursion does the rest. 1 Cross-Tradition Connections
Associated With
In Field
Invented By
Sources
1. Wikipedia: Quicksort
Wikimedia FoundationIntroduction, History and Formal analysis sectionsQuote, Introduction, History and Formal analysis sections
The quicksort algorithm was developed in 1959 by Tony Hoare while he was a visiting student at Moscow State University.
1. Wikipedia: Quicksort
Wikimedia FoundationFormal analysis sectionQuote, Formal analysis section
On average, the algorithm takes O(n log n) comparisons to sort n items.
1. Wikipedia: Quicksort
Wikimedia FoundationInvented By: Tony Hoare, History sectionQuote, Invented By: Tony Hoare, History section
The quicksort algorithm was developed in 1959 by Tony Hoare while he was a visiting student at Moscow State University.
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.
View At A Past Year
The atlas records no dated fact of its own for this entry, so there is no other year to choose.