[ nabia ]
[ aramo ]
[ 原始碼： pdqsort ]
套件： pdqsort-dev (0.0.0+git20180419-2.1)
pdqsort-dev 的相關超連結
Trisquel 的資源：
下載原始碼套件 pdqsort：
- [pdqsort_0.0.0+git20180419-2.1.dsc]
- [pdqsort_0.0.0+git20180419.orig.tar.gz]
- [pdqsort_0.0.0+git20180419-2.1.debian.tar.xz]
維護者：
Original Maintainer:
- Alexander GQ Gerasiov
外部的資源：
- 主頁 [github.com]
相似套件：
pattern-defeating quicksort compile-time c++ 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 Mussers introsort.
This package provides c++ header with drop-in replacement for std::sort.