Alternatives and similar repositories for SorterHunter:

Users that are interested in SorterHunter are comparing it to the libraries listed below

• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆117Updated last month
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆61Updated 3 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆154Updated last month
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆113Updated 4 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• rutgers-apl / The-RLIBM-Project
  A combined repository for all RLIBM prototypes
  ☆45Updated 4 months ago
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆58Updated last month
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆49Updated 6 months ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆76Updated 6 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• petersn / autosat
  Library for creation of SAT instances.
  ☆18Updated 2 years ago
• veluca93 / fpnge
  Demo of a fast PNG encoder.
  ☆94Updated 2 weeks ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆308Updated 3 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• uwplse / herbgrind
  A Valgrind tool for Herbie
  ☆93Updated 2 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆33Updated 6 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• IlyaGrebnov / libsais
  libsais is a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induce…
  ☆198Updated last month
• master-keying / minisat
  A minimalistic and high-performance SAT solver
  ☆144Updated 3 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆130Updated last year
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆83Updated 4 months 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…
  ☆45Updated 3 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆183Updated last year
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆64Updated last year
• jkbonfield / rans_static
  rANS coder (derived from https://github.com/rygorous/ryg_rans)
  ☆83Updated 2 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆100Updated 6 months ago
• jix / sortnetopt
  Lower Size Bounds for Sorting Networks
  ☆44Updated 4 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 11 months ago