✦ LIBER ✦

Algorithm 64: Quicksort

✍ Scribed by Hoare, C. A. R.

Book ID: 121302599
Publisher: Association for Computing Machinery
Year: 1961
Tongue: English
Weight: 170 KB
Volume: 4
Category: Article
ISSN: 0001-0782
DOI: 10.1145/366622.366644

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Parallel Quicksort Algorithm

✍ T. Brown; R.B. Xiong 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 537 KB

A fast parallel quicksort algorithm

✍ Charles U. Martel; Dan Gusfield 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 837 KB

A one-way, stackless quicksort algorithm

✍ Huang Bing-Chao; Donald E. Knuth 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 198 KB

Asymptotic analysis of an optimized quic

Asymptotic analysis of an optimized quicksort algorithm

✍ Marianne Durand 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Jon Bentley and Douglas McIlroy have implemented a fast quicksort for the C standard library in 1993. We consider here the average-case complexity in terms of number of comparisons of this algorithm, and give its asymptotic expansion up to the constant order.

Quicksort

✍ Sedgewick 📂 Library 📅 1980 🏛 Dissertations-G 🌐 English ⚖ 2 MB

A complete study is presented of the best general purpose method for sorting by computer: C. A. R. Hoare's Quicksort algorithm. Special attention is paid to the methods of mathematical analysis which are used to demonstrate the practical utility of the algorithm. The most efficient known form of Qui

Engineering quicksort

✍ S.Mansoor Sarwar; Syed Aqeel Sarwar; Mansour H.A. Jaragh; Jesse Brandeburg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 723 KB