Introsort (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Introsort" in English language version.

refsWebsite

Global rank English rank

383^rd place

320^th place

7,240^th place

4,476^th place

1,475^th place

1,188^th place

low place

low place

153^rd place

151^st place

69^th place

59^th place

2^nd place

2^nd place

low place

8,052^nd place

low place

low place

arxiv.org (Global: 69^th place; English: 59^th place)

Peters, Orson R. L. (2021). "orlp/pdqsort: Pattern-defeating quicksort". GitHub. arXiv:2106.05123.

danlark.org (Global: low place; English: low place)

Kutenin, Danila (20 April 2022). "Changing std::sort at Google's Scale and Beyond". Experimental chill.

doi.org (Global: 2^nd place; English: 2^nd place)

Lammich, Peter (2020). Efficient Verified Implementation of Introsort and Pdqsort. IJCAR 2020: Automated Reasoning. Vol. 12167. pp. 307–323. doi:10.1007/978-3-030-51054-1_18.

fosdem.org (Global: low place; English: low place)

archive.fosdem.org

Peters, Orson (2023). "Glidesort: Efficient In-Memory Adaptive Stable Sorting on Modern Hardware".

github.com (Global: 383^rd place; English: 320^th place)

libc++ source code: sort
Go 1.20.3 source code
Java 14 source code
Peters, Orson R. L. (2021). "orlp/pdqsort: Pattern-defeating quicksort". GitHub. arXiv:2106.05123.
"pdq.zig". GitHub. number of allowed imbalanced partitions before switching to heap sort.
van den Hoven, Igor (2021). "fluxsort". GitHub.
van den Hoven, Igor (2022). "crumsort". GitHub.
Tiselice, Dragoș (2022). "crumsort-rs". GitHub.
Bergdoll, Lukas (2024). "ipnsort: an efficient, generic and robust unstable sort implementation".
Bergdoll, Lukas (2024). "driftsort: an efficient, generic and robust stable sort implementation".

gnu.org (Global: 1,475^th place; English: 1,188^th place)

gcc.gnu.org

libstdc++ Documentation: Sorting Algorithms

microsoft.com (Global: 153^rd place; English: 151^st place)

msdn.microsoft.com

Array.Sort Method (Array)

rpi.edu (Global: 7,240^th place; English: 4,476^th place)

cs.rpi.edu

"Generic Algorithms", David Musser

rust-lang.org (Global: low place; English: 8,052^nd place)

doc.rust-lang.org

"slice.sort_unstable(&mut self)". Rust. The current algorithm is based on pattern-defeating quicksort by Orson Peters, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns. It uses some randomization to avoid degenerate cases, but with a fixed seed to always provide deterministic behavior.