Pattern-defeating quicksort library
27.05 KB
built 2026-10-29 13:00:12 GMT
Description
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.
Dependencies
4 totalRequires3
- gcc-c++
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
Provides1
- pdqsort-devel = 0-10.20210314gitb1ef26a.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
2Name  |
Size |
|---|---|
| pdqsort-b1ef26a55cdb60d236a5cb199c4234c704f46726.tar.gz | 14.56 KB |
| pdqsort.spec | 3.22 KB |
Files 1–2 of 2
Component of
buildroots that installed this RPMNo Buildroots