Our great sponsors
| Stage | pdqsort | |
|---|---|---|
| - | 9 | |
| 384 | 2,283 | |
| - | - | |
| 0.0 | 0.0 | |
| about 3 years ago | 5 months ago | |
| C++ | C++ | |
| GNU General Public License v3.0 only | zlib License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stage
We haven't tracked posts mentioning Stage yet.
Tracking mentions began in Dec 2020.
pdqsort
- Pattern-Defeating Quicksort (Pdqsort)
-
Faster sorting algorithm
I found that this exists: https://github.com/orlp/pdqsort
-
How sorting algorithms work
Their sort_unstable algorithm is based on this pattern-defeating quicksort.
-
Timsort – the fastest sorting algorithm you’ve never heard of
Closely related is pattern defeating quicksort ( https://github.com/orlp/pdqsort ), which adapts quicksort to take advantage of sorted runs. I've adapted a few quicksorts to pdqsort and seen good speedups (as people were often sorting partially sorted data)
Basically: Timsort is to mergesort as pdqsort is to quicksort
- I tried creating a sorting algorithm in C language.
- Do Low-Level Optimizations Matter?
-
Discussion Thread
I was thinking of optimal C++ over native types. I just spoke up because if your intuition of quicksort is that 50k elements should take 20ms you’re drastically underestimating computer performance. They’re crazy fast and optimized sorting algorithms are downright scary.
-
Beating Up on Qsort (2019)
Just for fun, I added pdqsort to the benchmark:
https://github.com/orlp/pdqsort
Here are some of the results on an Ivy Bridge hackintosh:
size, qsort, inline, sort, stable_sort, pdqsort, radix7 -
Which sorting algorithm did you implement in your programming language?
sort_unstable is a pattern-defeating quicksort (https://github.com/orlp/pdqsort) added with RFC#1884 (https://github.com/rust-lang/rfcs/pull/1884).
What are some alternatives?
Experimental Boost.MSM-lite - Boost.SML (formerly called Boost.MSM-lite)
fluxsort - A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
ZXing - ZXing ("Zebra Crossing") barcode scanning library for Java, Android
American Fuzzy Lop - american fuzzy lop - a security-oriented fuzzer
ZBar - Clone of the mercurial repository http://zbar.hg.sourceforge.net:8000/hgroot/zbar/zbar
quadsort - Quadsort is a branchless stable adaptive mergesort faster than quicksort.
c-smart-pointers - Smart pointers for the (GNU) C programming language
RE2 - RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library.
C++ Format - A modern formatting library