Mrrl / GrailSortLinks
Stable In-place sorting in O(n*log(n)) worst time
☆195Updated 2 years ago
Alternatives and similar repositories for GrailSort
Users that are interested in GrailSort are comparing it to the libraries listed below
Sorting:
- Fast and stable sort algorithm that uses O(1) memory. Public domain.☆1,287Updated 4 years ago
- A diverse array of heavily refactored versions of Andrey Astrelin's GrailSort.h, aiming to be as readable and intuitive as possible☆53Updated last year
- Testing common random-number generators (RNG)☆196Updated last month
- Hashing functions and PRNGs based on them☆167Updated 2 months ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated last year
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- Compile-time TRIE based string matcher (C++11)☆53Updated 6 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆67Updated 2 months ago
- A fast alternative to the modulo reduction☆316Updated 4 years ago
- arbitrary precision arithmetic library☆44Updated 7 years ago
- A fast preprocessor for C and C++☆534Updated 4 years ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- ☆242Updated 4 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- Bitset Sort, a faster std::sort replacement.☆79Updated 3 years ago
- header-only library to validate utf-8 strings at high speeds (using SIMD instructions)☆307Updated last year
- Random access array of tightly packed unsigned integers☆171Updated 3 years ago
- One of the fastest hash functions.☆364Updated 11 months ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆340Updated last year
- compile time assembly interpreter☆86Updated 7 years ago
- Binary floating-point to decimal string conversion algorithm.☆106Updated 8 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆136Updated 6 years ago
- Mandelbrot set in SIMD (SSE, AVX)☆85Updated 7 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆166Updated last year
- BSD Licensed Bignum Library☆233Updated last year
- PCG — C Implementation☆405Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆275Updated 4 years ago
- C library to remove white space from strings as fast as possible☆157Updated last year
- Swing, divide and conquer the factorial!☆81Updated 3 years ago