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

A stable quicksort

โœ Scribed by Dalia Motzkin


Book ID
112209824
Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
297 KB
Volume
11
Category
Article
ISSN
0038-0644

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

A fully vectorized quicksort
โœ Stewart A Levin ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 259 KB
A Parallel Quicksort Algorithm
โœ T. Brown; R.B. Xiong ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 537 KB
A perspective on Quicksort
โœ J. Jaja ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› American Institute of Physics ๐ŸŒ English โš– 491 KB
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