scandum / blitsortLinks
Blitsort is an in-place stable adaptive rotate mergesort / quicksort.
☆708Updated last year
Alternatives and similar repositories for blitsort
Users that are interested in blitsort are comparing it to the libraries listed below
Sorting:
- A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.☆716Updated last year
- A collection of improved binary search algorithms.☆670Updated 2 months ago
- All-inclusive Buffer for C☆412Updated last year
- A branchless unstable quicksort / mergesort that is highly adaptive.☆331Updated last year
- Stevan Apter-style trees in C++17☆375Updated last year
- The PolymurHash universal hash function.☆357Updated 2 years ago
- Wolfsort is a stable adaptive hybrid radix / merge sort.☆196Updated last year
- A stable adaptive partitioning comparison sort.☆208Updated last year
- A hash array-mapped trie implementation in C☆308Updated last year
- A simple C coroutine library.☆227Updated last year
- Automated integer hash function discovery☆730Updated last year
- A collection of array rotation algorithms.☆155Updated 2 years ago
- Unintrusive algorithms for C arrays OR a C implementation of <algorithm> from C++☆215Updated 2 years ago
- A fully lock-free game engine written in C++20☆736Updated last year
- Integer Map Data Structure☆131Updated 2 years ago
- nsync is a C library that exports various synchronization primitives, such as mutexes☆1,195Updated 4 months ago
- SIMD-enhanced word counter