✦ LIBER ✦
Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
✍ Scribed by Mikkel Thorup
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 187 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
✦ Synopsis
A randomized sorting algorithm is presented, doing as described in the title. Implications of the techniques are discussed for dictionaries and priority queues.