gerben-s / quicksort-blog-postLinks
☆39Updated 4 years ago
Alternatives and similar repositories for quicksort-blog-post
Users that are interested in quicksort-blog-post are comparing it to the libraries listed below
Sorting:
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆74Updated 2 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- SIMD sorting network generator and very basic tester☆16Updated 3 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Different algorithms for converting binary to decimal floating-point numbers☆124Updated 2 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- Benchmarks for our memory allocator☆69Updated 2 years ago
- Radix sorting from the ground up☆37Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Comparing linear and binary searches☆41Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆158Updated last month
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆32Updated last year
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆126Updated 8 months ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- ☆31Updated 4 years ago
- benchmarking positional population count☆15Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 5 years ago
- For details, see the blog post:☆33Updated last year
- ☆109Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago