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 5 months ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆308Updated 4 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆134Updated 5 years ago
• erthink / t1ha
  One of the fastest hash functions.
  ☆353Updated 3 months ago
• skarupke / ska_sort
  ☆237Updated 4 years ago
• Morwenn / vergesort
  Unstable O(n log n) sorting algorithm with O(n) memory
  ☆60Updated last year
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆161Updated 3 months ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆136Updated 3 months ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 6 years ago
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆316Updated 5 months ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆277Updated last year
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆162Updated 3 months ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆344Updated 10 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆118Updated 8 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆115Updated 4 years ago
• lemire / fastvalidate-utf-8
  header-only library to validate utf-8 strings at high speeds (using SIMD instructions)
  ☆301Updated last year
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• danlark1 / miniselect
  Selection and partial sorting algorithms
  ☆137Updated last month
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆397Updated 3 months ago
• Morwenn / poplar-heap
  make_heap and sort_heap for a poplar heap with O(1) extra memory
  ☆40Updated 10 months ago
• marcandrysco / Errol
  Binary floating-point to decimal string conversion algorithm.
  ☆103Updated 7 years ago
• rofl0r / order-pp
  order-pp preprocessor library (standalone part of chaos-pp)
  ☆111Updated 3 years ago
• ned14 / nedtries
  A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…
  ☆274Updated 3 years ago
• jonmaiga / mx3
  A bit mixer, pseudo random number generator and a hash function.
  ☆28Updated 3 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated 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(…
  ☆50Updated last year
• suiginsoft / hebimath
  arbitrary precision arithmetic library
  ☆43Updated 6 years ago