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)
  ☆118Updated 3 months ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆52Updated 8 months ago
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆61Updated 3 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆115Updated 4 years ago
• petersn / autosat
  Library for creation of SAT instances.
  ☆20Updated 2 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 4 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 6 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆104Updated 8 months ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆83Updated last year
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 3 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆43Updated 3 weeks ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• jkbonfield / rans_static
  rANS coder (derived from https://github.com/rygorous/ryg_rans)
  ☆83Updated 3 years ago
• dbkaplun / fse-made-easy
  Runnable pseudocode for Finite State Entropy compression
  ☆29Updated 7 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆309Updated 4 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• pmntang / SIMDGiraffe
  Visualize SIMD instructions
  ☆33Updated last year
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆161Updated 3 months ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆40Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆70Updated 3 years ago
• powturbo / Turbo-Range-Coder
  TurboRC - Fastest Range Coder + Arithmetic Coding / Fastest Asymmetric Numeral Systems
  ☆80Updated last year
• andralex / MedianOfNinthers
  ☆49Updated 5 years ago
• michaelmaniscalco / msufsort
  msufsort parallel suffix array construction algorithm
  ☆29Updated 4 years ago