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)
  ☆123Updated 7 months ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆55Updated last year
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆110Updated this week
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆157Updated last week
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆60Updated 6 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆187Updated 2 years ago
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆124Updated 2 years ago
• petersn / autosat
  Library for creation of SAT instances.
  ☆23Updated 2 years ago
• WojciechMula / toys
  Storage for my snippets, toy programs, etc.
  ☆363Updated 5 months ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆61Updated 3 years ago
• richgel999 / sserangecoding
  Fast vectorized (SSE 4.1) range coder for 8-bit alphabets
  ☆25Updated 2 years ago
• master-keying / minisat
  A minimalistic and high-performance SAT solver
  ☆146Updated 3 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆311Updated 4 years ago
• leni536 / fast_hilbert_curve
  Fast caclulation of the coordinates of the nth point of the Hilbert curve
  ☆17Updated 6 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…
  ☆48Updated 4 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• billziss-gh / imap
  Integer Map Data Structure
  ☆131Updated 2 years ago
• aphitorite / Logsort
  O(n log n) In-place Stable Quicksort
  ☆20Updated 3 weeks ago
• oschonrock / binfuse
  c++ library for binary fuse filters, including a sharded filter
  ☆92Updated 7 months ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆220Updated 3 weeks ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆70Updated 3 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 7 years ago
• danielcota / biski64
  A very fast and robust 64-bit PRNG with a minimum 2^64 period.
  ☆148Updated 2 months ago
• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆357Updated 2 years ago
• scandum / rotate
  A collection of array rotation algorithms.
  ☆156Updated 2 years ago