stgatilov / linear-vs-binary-search
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
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- ☆39Updated 4 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
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆43Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- Vectorized version of the PCG random number generator☆77Updated last month
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Radix sorting from the ground up☆36Updated last year
- Random Number Generator based on hardware-accelerated AES instructions☆57Updated 6 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆65Updated 4 years ago
- For details, see the blog post:☆32Updated last year
- LZ77/LZSS designed for SSE based decompression☆139Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Benchmarks for our memory allocator☆63Updated last year
- Experiments with array layouts for comparison-based searching☆83Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- ☆44Updated 4 years ago
- A collection of SIMD optimized general purpose hash functions☆44Updated 10 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Fast open addressing hash table☆41Updated last year
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 3 months ago