✦ LIBER ✦

Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves

✍ Scribed by Gianni Franceschini

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sorting in Average Time $o(\log \,n)$

✍ Ajtai, M.; Karabeg, D.; Komlós, J.; Szemerédi, E. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 991 KB

Bounded ordered dictionaries in O(log lo

✍ Kurt Mehlhorn; Stefan Näher 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 456 KB

Sorting the sums (xi + yj) in O(n2) comp

✍ Jean-Luc Lambert 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Matching Nuts and Bolts in O(n log n) Ti

✍ Komlós, János; Ma, Yuan; Szemerédi, Endre 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 454 KB

Stabbing isothetic boxes and rectangles

✍ Michael E. Hohmeyer; Seth J. Teller 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Atomic Snapshots in O ( n log n ) Operat

✍ Attiya, Hagit; Rachman, Ophir 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 838 KB