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:
- Vectorized version of the PCG random number generator☆80Updated 5 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- 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
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 4 years ago
- Lace - implementation of work-stealing in C☆52Updated this week
- Random Number Generator based on hardware-accelerated AES instructions☆59Updated 6 years ago
- ☆39Updated 4 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆117Updated 5 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 7 months ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Unstable O(n log n) sorting algorithm with O(n) memory☆61Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Radix sorting from the ground up☆37Updated last year
- Benchmarks for our memory allocator☆68Updated last year
- Bloom filter alternative (C++)☆18Updated 6 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- Fastest Histogram Construction☆70Updated 3 years ago
- fast open addressing hash table☆41Updated 2 weeks ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆41Updated 11 years ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Updated 3 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago