✦ LIBER ✦

A select and insert sorting algorithm

✍ Scribed by István Beck; Stein Krogdahl

Publisher: Springer Netherlands
Year: 1988
Tongue: English
Weight: 514 KB
Volume: 28
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01954893

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Introspective Sorting and Selection Algo

Introspective Sorting and Selection Algorithms

✍ DAVID R. MUSSER 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed inputs is Θ(N log N), and it is in fact faster than most other sorting algorithms on most inputs. Its drawback is that its worst-case time bound is Θ(N 2 . Previous attem

A fast sorting algorithm

✍ L. S. Lozinskii; S. B. Pogrebinskii 📂 Article 📅 1966 🏛 Springer US 🌐 English ⚖ 330 KB

Sorting-Based Selection Algorithms for H

Sorting-Based Selection Algorithms for Hypercubic Networks

✍ P. Berthomé; A. Ferreira; B. M. Maggs; S. Perennes; C. G. Plaxton 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 94 KB

Noisy sort, a memory-intensive sorting a

Noisy sort, a memory-intensive sorting algorithm

✍ Susumu Horiguchi; Williard L. Miranker 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 859 KB

On a certain sorting algorithm

✍ S. G. Kizhner 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 187 KB

A Wait-Free Sorting Algorithm

✍ N. Shavit; E. Upfal; A. Zemach 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 181 KB