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,282Updated 3 years ago
• lemire / fastvalidate-utf-8
  header-only library to validate utf-8 strings at high speeds (using SIMD instructions)
  ☆302Updated last year
• 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
  ☆49Updated 10 months ago
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆164Updated 9 months ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆191Updated 2 years ago
• imneme / pcg-c
  PCG — C Implementation
  ☆391Updated 2 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• marcandrysco / Errol
  Binary floating-point to decimal string conversion algorithm.
  ☆104Updated 7 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated 9 months ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆280Updated last year
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆330Updated 11 months ago
• imneme / pcg-c-basic
  PCG — Minimal C Implementation
  ☆431Updated last year
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆232Updated last year
• skeeto / mandel-simd
  Mandelbrot set in SIMD (SSE, AVX)
  ☆83Updated 7 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 7 years ago
• skarupke / ska_sort
  ☆242Updated 4 years ago
• erthink / t1ha
  One of the fastest hash functions.
  ☆361Updated 8 months ago
• stryku / ctai
  compile time assembly interpreter
  ☆86Updated 7 years ago
• vnmakarov / yaep
  Yet Another Earley Parser
  ☆141Updated 3 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆135Updated 6 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆64Updated 2 years ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆52Updated 6 years ago
• Morwenn / poplar-heap
  make_heap and sort_heap for a poplar heap with O(1) extra memory
  ☆41Updated last year
• espadrine / shishua
  SHISHUA – The fastest PRNG in the world
  ☆216Updated 2 years ago
• suiginsoft / hebimath
  arbitrary precision arithmetic library
  ☆44Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆60Updated 6 years ago
• WojciechMula / toys
  Storage for my snippets, toy programs, etc.
  ☆368Updated 7 months ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago