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

Sorting in linear expected time

โœ Scribed by M. T. Noga; D. C. S. Allison

Book ID
105403821
Publisher
Springer Netherlands
Year
1985
Tongue
English
Weight
840 KB
Volume
25
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sorting in Linear Time?
Sorting in Linear Time?
โœ Arne Andersson; Torben Hagerup; Stefan Nilsson; Rajeev Raman ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 679 KB

We show that a unit-cost RAM with a word length of w bits can sort n integers in the range 0 } } } 2 w &1 in O(n log log n) time for arbitrary w log n, a significant improvement over the bound of O(nlog n) achieved by the fusion trees of Fredman and Willard. Provided that w (log n) 2+= for some fixe

Divide and conquer for linear expected t
Divide and conquer for linear expected time
โœ Jon Louis Bentley; Michael Ian Shamos ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 648 KB