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)
  ☆120Updated 5 months ago
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆61Updated 3 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆53Updated 10 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆108Updated 10 months ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆57Updated 6 years ago
• petersn / autosat
  Library for creation of SAT instances.
  ☆21Updated 2 years ago
• rutgers-apl / The-RLIBM-Project
  A combined repository for all RLIBM prototypes
  ☆45Updated 9 months ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 6 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• jix / sortnetopt
  Lower Size Bounds for Sorting Networks
  ☆45Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• slothy-optimizer / slothy
  Assembly super-optimization via constraint solving
  ☆202Updated this week
• amd / aocl-libm-ose
  AOCL-LibM
  ☆115Updated last month
• pmntang / SIMDGiraffe
  Visualize SIMD instructions
  ☆32Updated last year
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 years ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆43Updated last month
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• scandum / rotate
  A collection of array rotation algorithms.
  ☆155Updated 2 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆97Updated 3 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 5 months ago
• leni536 / fast_hilbert_curve
  Fast caclulation of the coordinates of the nth point of the Hilbert curve
  ☆17Updated 6 years ago
• flintlib / calcium
  Calcium has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
  ☆81Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• aphitorite / Logsort
  O(n log n) In-place Stable Quicksort
  ☆18Updated 6 months ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆73Updated 2 years ago