Alternatives and similar repositories for Rewritten-Grailsort:

Users that are interested in Rewritten-Grailsort are comparing it to the libraries listed below

• aphitorite / Logsort
  O(n log n) In-place Stable Quicksort
  ☆16Updated 3 months ago
• Mrrl / GrailSort
  Stable In-place sorting in O(n*log(n)) worst time
  ☆190Updated last year
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 6 years ago
• nigeltao / qoi2-bikeshed
  "Quite OK Image" version 2 discussions
  ☆34Updated 3 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• mlochbaum / rhsort
  Robin Hood Sort, for uniform data
  ☆73Updated last year
• jonmaiga / mx3
  A bit mixer, pseudo random number generator and a hash function.
  ☆27Updated 2 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆51Updated 7 months ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• bertdobbelaere / SorterHunter
  An evolutionary approach to find small and low latency sorting networks
  ☆63Updated 3 weeks ago
• Morwenn / poplar-heap
  make_heap and sort_heap for a poplar heap with O(1) extra memory
  ☆38Updated 8 months ago
• scandum / rotate
  A collection of array rotation algorithms.
  ☆154Updated 2 years ago
• camel-cdr / bfcpp
  Optimizing Brainfuck interpreter in the C preprocessor
  ☆61Updated 2 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆56Updated 5 years ago
• IlyaGrebnov / libcubwt
  libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.
  ☆35Updated last month
• loxxous / Jampack
  Experimental parallel compression algorithm
  ☆24Updated 7 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• deus-libri / preflate
  deflate stream reconstruction library
  ☆34Updated 6 years ago
• scandum / octosort
  Octosort is an in-place stable adaptive block merge sort.
  ☆18Updated 2 years ago
• dougallj / zlib-dougallj
  Experimental fork of zlib with performance improvements
  ☆35Updated 2 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 2 months ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• stbrumme / length-limited-prefix-codes
  A collection of various algorithms to produce length-limited prefix codes
  ☆24Updated 3 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• ThePhD / future_cxx
  Work done today for the glory of tomorrow - or, C and C++ systems programming papers.
  ☆53Updated this week
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• BonzaiThePenguin / WikiSort
  Fast and stable sort algorithm that uses O(1) memory. Public domain.
  ☆1,277Updated 3 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 4 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆113Updated 4 years ago