Implementing Quicksort Programs

Research output: Contribution to journalArticle

167 Scopus citations

Abstract

This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computers, including how to apply various code optimization techniques. A detailed implementation combining the most effective improvements to Quicksort is given, along with a discussion of how to implement it in assembly language. Analytic results describing the performance of the programs are summarized. A variety of special situations are considered from a practical standpoint to illustrate Quicksort's wide applicability as an internal sorting method which requires negligible extra storage.

Original languageEnglish (US)
Pages (from-to)847-857
Number of pages11
JournalCommunications of the ACM
Volume21
Issue number10
DOIs
StatePublished - Oct 1 1978
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Implementing Quicksort Programs'. Together they form a unique fingerprint.

  • Cite this