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

• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆52Updated 4 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆70Updated 2 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 8 months ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 5 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆61Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• trolando / lace
  Lace - implementation of work-stealing in C
  ☆55Updated 3 months ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆76Updated 3 years ago
• cleeus / hashx4
  A collection of SIMD optimized general purpose hash functions
  ☆47Updated 10 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• rmind / tlsf
  TLSF: two-level segregated fit O(1) allocator
  ☆80Updated 3 years ago
• cksystemsgroup / scalloc
  A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator
  ☆163Updated 4 months ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• aklomp / missing-sse-intrinsics
  Polyfill some holes in the SSE intrinsics set
  ☆50Updated 3 years ago
• androm3da / optviewer-demo
  Demonstration of LLVM's opt-viewer tool
  ☆71Updated 8 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆58Updated last year
• ConorStokes / LZSSE
  LZ77/LZSS designed for SSE based decompression
  ☆143Updated 6 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆72Updated 3 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated 2 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆62Updated 4 years ago