Alternatives and similar repositories for sort-bench

Users that are interested in sort-bench are comparing it to the libraries listed below

• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 4 months 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
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 4 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆154Updated 10 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• lemire / cbitset
  A simple bitset library in C
  ☆134Updated 4 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆59Updated 6 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆70Updated 3 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆48Updated 6 years ago
• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆89Updated 2 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆39Updated 4 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆156Updated 5 months ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 9 months ago