Mrrl / GrailSortLinks
Stable In-place sorting in O(n*log(n)) worst time
☆192Updated 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,285Updated 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☆50Updated last year
- PCG — C Implementation☆401Updated 2 years ago
- Hashing functions and PRNGs based on them☆166Updated last month
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- Testing common random-number generators (RNG)☆194Updated last week
- A fast alternative to the modulo reduction☆315Updated 4 years ago
- header-only library to validate utf-8 strings at high speeds (using SIMD instructions)☆304Updated last year
- BSD Licensed Bignum Library☆232Updated last year
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆136Updated 6 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 6 years ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- PCG — Minimal C Implementation☆431Updated 2 years ago
- checkedthreads: no race condition goes unnoticed! Simple API, automatic load balancing, Valgrind-based checking☆295Updated 12 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated 11 months ago
- Mandelbrot set in SIMD (SSE, AVX)☆85Updated 7 years ago
- ☆243Updated 4 years ago
- arbitrary precision arithmetic library☆44Updated 7 years ago
- Random access array of tightly packed unsigned integers☆171Updated 3 years ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆163Updated 6 months ago
- Binary floating-point to decimal string conversion algorithm.☆106Updated 8 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆276Updated 4 years ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆204Updated 6 years ago
- One of the fastest hash functions.☆363Updated 10 months ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- C library to remove white space from strings as fast as possible☆156Updated last year
- compile time assembly interpreter☆86Updated 7 years ago
- Vectorized version of the PCG random number generator☆84Updated 9 months ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆67Updated last month
- Experiments with array layouts for comparison-based searching☆86Updated last year