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)
  ☆119Updated 3 months ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆53Updated 9 months ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 6 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 3 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆115Updated 4 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…
  ☆206Updated last month
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆61Updated 3 years ago
• petersn / autosat
  Library for creation of SAT instances.
  ☆21Updated 2 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆57Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆350Updated last year
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆308Updated 4 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆105Updated 9 months ago
• vigna / sux
  Succinct data structures in C/C++
  ☆87Updated 7 months ago
• aphitorite / Logsort
  O(n log n) In-place Stable Quicksort
  ☆16Updated 4 months ago
• jix / sortnetopt
  Lower Size Bounds for Sorting Networks
  ☆44Updated 4 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• amd / aocl-libm-ose
  AOCL-LibM
  ☆113Updated this week
• rutgers-apl / The-RLIBM-Project
  A combined repository for all RLIBM prototypes
  ☆45Updated 7 months ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆70Updated 3 years ago
• weissenberger / multians
  Massively Parallel ANS Decoding on GPUs
  ☆28Updated 5 years ago
• flintlib / calcium
  Calcium has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
  ☆81Updated last year
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆43Updated last week
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆36Updated last year
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆162Updated 3 months ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year