bertdobbelaere / SorterHunter
An evolutionary approach to find small and low latency sorting networks
☆55Updated 3 weeks ago
Related projects ⓘ
Alternatives and complementary repositories for SorterHunter
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆114Updated 6 months ago
- A benchmark for sorting algorithms☆59Updated 3 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆95Updated 3 months ago
- RLibm for 32-bit representations (float and posit32)☆61Updated 3 years ago
- Methods and Benchmarks for Random Numbers in a Range☆33Updated 6 years ago
- ☆39Updated 3 years ago
- A fast binary search that tries to be branchless☆95Updated 8 months ago
- Experiments with array layouts for comparison-based searching☆80Updated 10 months ago
- Fast vectorized (SSE 4.1) range coder for 8-bit alphabets☆23Updated last year
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆46Updated 3 months ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 2 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated last month
- O(n log n) In-place Stable Quicksort