๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Quicksort

โœ Scribed by Sedgewick


Book ID
127424531
Publisher
Dissertations-G
Year
1980
Tongue
English
Weight
2 MB
Series
Outstanding Dissertations in the Computer Sciences
Edition
1
Category
Library
ISBN
0824044177

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 Quicksort is developed, and exact formulas are derived for the average, best case, and worst case running times. The merits of the many modifications which have been suggested to improve Quicksort are discussed, with an emphasis on their impact upon the analysis. Van Emden's method, samplesort, and the median-of-three modification are discussed in detail, and it is shown that the latter is the most effective improvement to Quicksort for practical sorting applications.


๐Ÿ“œ SIMILAR VOLUMES


Engineering quicksort
โœ S.Mansoor Sarwar; Syed Aqeel Sarwar; Mansour H.A. Jaragh; Jesse Brandeburg ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 723 KB
Parallel quicksort
โœ Bogdan S. Chlebus; Imrich Vrลฅo ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 583 KB
Quicksort revisited
โœ Davidson, C.M. ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› IEEE ๐ŸŒ English โš– 201 KB
A stable quicksort
โœ Dalia Motzkin ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 297 KB
Algorithm 64: Quicksort
โœ Hoare, C. A. R. ๐Ÿ“‚ Article ๐Ÿ“… 1961 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 170 KB
The Quicksort process
โœ Ragab, Mahmoud; Roesler, Uwe ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB