Alternatives and similar repositories for Rewritten-Grailsort

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

• Mrrl / GrailSort
  Stable In-place sorting in O(n*log(n)) worst time
  ☆192Updated 2 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 7 years ago
• aphitorite / Logsort
  O(n log n) In-place Stable Quicksort
  ☆20Updated 4 months ago
• IlyaGrebnov / libcubwt
  libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.
  ☆39Updated 4 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆62Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆61Updated 6 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆62Updated 6 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆194Updated last week
• easyaspi314 / xxhash-clean
  xxHash Cleaner C Reference Implementation
  ☆46Updated 5 years ago
• mlochbaum / rhsort
  Robin Hood Sort, for uniform data
  ☆75Updated 2 years ago
• scandum / rotate
  A collection of array rotation algorithms.
  ☆162Updated 2 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆58Updated last year
• camel-cdr / bfcpp
  Optimizing Brainfuck interpreter in the C preprocessor
  ☆65Updated 3 years ago
• BonzaiThePenguin / WikiSort
  Fast and stable sort algorithm that uses O(1) memory. Public domain.
  ☆1,285Updated 4 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆120Updated 5 years ago
• taisei-project / koishi
  Decently portable C11 coroutine library
  ☆31Updated last year
• bertdobbelaere / SorterHunter
  An evolutionary approach to find small and low latency sorting networks
  ☆75Updated last month
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated last month
• nadavrot / compressor
  An educational implementation of a modern compressor in Rust
  ☆48Updated 2 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• nigeltao / qoi2-bikeshed
  "Quite OK Image" version 2 discussions
  ☆34Updated 4 years ago
• bdonlan / branchless-utf8
  Branchless UTF-8 decoder
  ☆36Updated 8 years ago
• veluca93 / fpnge
  Demo of a fast PNG encoder.
  ☆98Updated 2 months ago
• jonmaiga / mx3
  A bit mixer, pseudo random number generator and a hash function.
  ☆29Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 9 months ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• peterferrie / hc256
  HC-256 Stream cipher in x86 assembly
  ☆19Updated 8 years ago
• richgel999 / rdopng
  Rate-Distortion Optimized Lossy PNG/QOI Encoding Tool
  ☆96Updated 5 months ago
• avaneev / komihash
  Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, header-only C/C++) 27GB/s + …
  ☆266Updated last week