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

• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 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…
  ☆44Updated 3 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆61Updated 11 months ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆22Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• goldsteinn / SIMD-sorting-network
  SIMD sorting network generator and very basic tester
  ☆16Updated 2 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆75Updated 6 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆37Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆30Updated 7 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆68Updated 3 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆51Updated 10 months ago
• michaeljclark / ethical_hashmap
  Fast open addressing hash table
  ☆41Updated last year
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆56Updated 5 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆62Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• orlp / devector
  Resizable contiguous sequence container with fast appends on either end.
  ☆37Updated 7 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆90Updated last year
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆31Updated 7 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• trolando / lace
  Lace - implementation of work-stealing in C
  ☆35Updated 9 months ago