Alternatives and similar repositories for GrailSort

Users that are interested in GrailSort are comparing it to the libraries listed below

• BonzaiThePenguin / WikiSort
  Fast and stable sort algorithm that uses O(1) memory. Public domain.
  ☆1,286Updated 4 years ago
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆167Updated 2 months ago
• HolyGrailSortProject / Rewritten-Grailsort
  A diverse array of heavily refactored versions of Andrey Astrelin's GrailSort.h, aiming to be as readable and intuitive as possible
  ☆54Updated last year
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆198Updated last month
• marcandrysco / Errol
  Binary floating-point to decimal string conversion algorithm.
  ☆106Updated 8 years ago
• lemire / fastvalidate-utf-8
  header-only library to validate utf-8 strings at high speeds (using SIMD instructions)
  ☆307Updated last year
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated last year
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆317Updated 4 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆281Updated last year
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆136Updated 6 years ago
• imneme / pcg-c
  PCG — C Implementation
  ☆406Updated 2 years ago
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆233Updated last year
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆341Updated last year
• skarupke / ska_sort
  ☆243Updated 4 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆79Updated 4 years ago
• expr-fi / fastlwc
  SIMD-enhanced word counter
  ☆253Updated 6 years ago
• stryku / ctai
  compile time assembly interpreter
  ☆86Updated 7 years ago
• suiginsoft / hebimath
  arbitrary precision arithmetic library
  ☆44Updated 7 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆122Updated 5 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 7 years ago
• gpakosz / PackedArray
  Random access array of tightly packed unsigned integers
  ☆171Updated 3 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago
• leegao / float-hacks
  Floating Point Hacks
  ☆169Updated 8 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆61Updated 6 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago
• skeeto / mandel-simd
  Mandelbrot set in SIMD (SSE, AVX)
  ☆85Updated 7 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆67Updated 3 months ago
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆205Updated 6 years ago