stgatilov / linear-vs-binary-searchLinks
Comparing linear and binary searches
☆40Updated 5 years ago
Alternatives and similar repositories for linear-vs-binary-search
Users that are interested in linear-vs-binary-search are comparing it to the libraries listed below
Sorting:
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆66Updated 4 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆45Updated 4 years ago
- For details, see the blog post:☆32Updated last year
- Random Number Generator based on hardware-accelerated AES instructions☆57Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A collection of SIMD optimized general purpose hash functions☆45Updated 10 years ago
- ☆39Updated 4 years ago
- Benchmarks for our memory allocator☆64Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer☆25Updated 2 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- benchmarking positional population count☆14Updated last year
- Bloom filter alternative (C++)☆18Updated 6 years ago
- How fast can we shuffle values?☆37Updated last year
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Fast open addressing hash table☆41Updated last year
- A benchmark for sorting algorithms☆60Updated 4 years ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical☆45Updated 6 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- Vectorized version of the PCG random number generator☆77Updated 2 months ago
- Linear vs binary search benchmark☆40Updated 5 years ago