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

The Quicksort process

โœ Scribed by Ragab, Mahmoud; Roesler, Uwe


Book ID
125437792
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
257 KB
Volume
124
Category
Article
ISSN
0304-4149

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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
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