eloj / radix-sortingLinks
Radix sorting from the ground up
☆37Updated last year
Alternatives and similar repositories for radix-sorting
Users that are interested in radix-sorting are comparing it to the libraries listed below
Sorting:
- ☆39Updated 4 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- ☆31Updated 4 years ago
- Vectorized version of the PCG random number generator☆83Updated 5 months ago
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆55Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆118Updated 5 years ago
- A fast implementation of log() and exp()☆52Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- SIMD sorting network generator and very basic tester☆16Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆48Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆123Updated 7 months ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- ☆108Updated last year
- Comparing linear and binary searches☆41Updated 5 years ago
- Fast in-place radix sort with STL-like API☆47Updated 8 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆66Updated 10 years ago
- InstLatX64_Demo☆44Updated 2 weeks ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆236Updated 2 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 7 months ago
- benchmarking positional population count☆15Updated last year
- Storage for my snippets, toy programs, etc.☆363Updated 5 months ago
- TLSF: two-level segregated fit O(1) allocator☆80Updated 2 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- Benchmarks for our memory allocator☆69Updated last year
- Succinct data structures in C/C++☆88Updated 10 months ago