Source Package: pdqsort (0-8.20210314gitb1ef26a.fc43)
Pattern-defeating quicksort library
Pattern-defeating quicksort (pdqsort) is a novel sorting algorithm that combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on inputs with certain patterns. pdqsort is an extension and improvement of David Musser's introsort.
Package information
- Homepage
- [https://github.com/orlp/pdqsort]
- License
- Zlib
- Maintainer del pacchetto downstream
- jjamesObserved Nov 20, 2026 [source]
The following binary packages are built from this source package:
- pdqsort-devel
Pattern-defeating quicksort library
