pdqsort-devel Subpackage of pdqsort
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.
Releases Overview
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 0-6.20210314gitb1ef26a.fc41 | - |
| Fedora 41 | 0-6.20210314gitb1ef26a.fc41 | - |
| Fedora 40 | 0-4.20210314gitb1ef26a.fc40 | - |
File a new bug report »
Package Info
Package Info
- Upstream: https://github.com/orlp/pdqsort
- License(s): Zlib
- Maintainer: jjames
You can contact the maintainers of this package via email at
pdqsort dash maintainers at fedoraproject dot org.
Sources on Pagure