libdjbsort

djbsort sorts arrays of integers or floats in-place using sorting networks. Sorting networks scale O(n log^2 n), but help to protect against timing attacks. Where available, djbsort uses vector instructions for better performance. djbsort performs well in sorting benchmarks and thus is well-suited in cryptographic and non-cryptographic contexts.

Releases Overview