stgatilov / linear-vs-binary-searchLinks
Comparing linear and binary searches
☆41Updated 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:
- Benchmarks for our memory allocator☆69Updated last year
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆50Updated 4 years ago
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Lace - implementation of work-stealing in C☆53Updated last month
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆68Updated 4 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 8 months ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- For details, see the blog post:☆32Updated last year
- ☆39Updated 4 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- SIMD (SSE) string functions☆102Updated 8 years ago
- Fastest Histogram Construction☆71Updated 3 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆61Updated 2 years ago
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- fast open addressing hash table☆41Updated 2 months ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- A collection of SIMD optimized general purpose hash functions☆47Updated 10 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆62Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago