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)
  ☆125Updated 8 months ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆111Updated last week
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆55Updated last year
• danielcota / biski64
  A very fast and robust 64-bit PRNG with a minimum 2^64 period.
  ☆148Updated 3 months ago
• ForwardCom / manual
  Reference manual for ForwardCom instruction set and software standards
  ☆170Updated 8 months ago
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆125Updated 2 years ago
• aphitorite / Logsort
  O(n log n) In-place Stable Quicksort
  ☆20Updated last month
• WojciechMula / toys
  Storage for my snippets, toy programs, etc.
  ☆366Updated 6 months ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆131Updated 2 years ago
• slothy-optimizer / slothy
  Assembly super-optimization via constraint solving
  ☆220Updated this week
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆220Updated 2 weeks ago
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆61Updated 4 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆158Updated last month
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆60Updated 6 years ago
• petersn / autosat
  Library for creation of SAT instances.
  ☆24Updated 3 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆188Updated 2 years ago
• scandum / rotate
  A collection of array rotation algorithms.
  ☆156Updated 2 years ago
• rutgers-apl / The-RLIBM-Project
  A combined repository for all RLIBM prototypes
  ☆46Updated last year
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆119Updated 5 years ago
• master-keying / minisat
  A minimalistic and high-performance SAT solver
  ☆146Updated 3 years ago
• skarupke / branchless_binary_search
  A fast binary search that tries to be branchless
  ☆101Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆61Updated 4 years ago
• oschonrock / binfuse
  c++ library for binary fuse filters, including a sharded filter
  ☆93Updated 7 months ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• veluca93 / fpnge
  Demo of a fast PNG encoder.
  ☆97Updated 7 months ago
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆325Updated 10 months ago
• clemensmanert / fas
  A floating point arithmetic which works with types of any mantissa, exponent or base in modern header-only C++.
  ☆83Updated 11 months ago