scandum / quadsort

Quadsort is a branchless stable adaptive mergesort faster than quicksort.

scandum/quadsort Issues

Comparison to Timsort and Block sort
Closed 4 years ago9
how to compile quadsort as a so file
Updated a year ago2
Some compilation errors
Closed a year ago12
Ping pong merge | multi-threaded merge sorts
Updated a year ago12
Usage of bit masks and some code improvements
Updated 2 years ago6
[Question] Just trying to understand mysterious (for me) `else`
Closed 2 years ago2
Docs Question
Closed 4 years ago3
Bug in quadsort.h
Closed 3 years ago3
Do you consider using C++'s template?
Closed 3 years ago3
Copy-free license
Closed 3 years ago2
Python Version
Closed 3 years ago1
The quadsort doesn't even compile.
Closed 4 years ago2
Axis need labels
Closed 4 years ago1
The pointers d and d_max are set to offsets in different arrays before goto quickstep.
Closed 4 years ago
Did you consider SIMD/MIMD?
Closed 4 years ago2