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,277Updated 3 years 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
  ☆48Updated 4 months ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆136Updated 2 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆161Updated 2 months ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆309Updated 4 years ago
• skarupke / ska_sort
  ☆236Updated 4 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆133Updated 5 years ago
• orangeduck / CPP_COMPLETE
  Brainfuck interpreter written in the C preprocessor
  ☆234Updated 9 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆276Updated last year
• stryku / ctai
  compile time assembly interpreter
  ☆85Updated 7 years ago
• jonmaiga / mx3
  A bit mixer, pseudo random number generator and a hash function.
  ☆27Updated 2 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆83Updated last year
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆312Updated 4 months ago
• Morwenn / poplar-heap
  make_heap and sort_heap for a poplar heap with O(1) extra memory
  ☆38Updated 9 months ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆113Updated 4 years ago
• cksystemsgroup / scalloc
  A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator
  ☆162Updated 2 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• bisqwit / cpp_parallelization_examples
  The study & production material for https://www.youtube.com/watch?v=Pc8DfEyAxzg
  ☆172Updated 7 years ago
• foonathan / tiny
  low-level library for minimizing the size of your types
  ☆113Updated 5 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆57Updated 5 years ago
• danlark1 / miniselect
  Selection and partial sorting algorithms
  ☆136Updated last week
• erthink / t1ha
  One of the fastest hash functions.
  ☆352Updated last month
• marcandrysco / Errol
  Binary floating-point to decimal string conversion algorithm.
  ☆103Updated 7 years ago
• espadrine / shishua
  SHISHUA – The fastest PRNG in the world
  ☆208Updated last year
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 11 months ago