blitsort
by scandum
Blitsort is an in-place stable adaptive rotate mergesort / quicksort.
AI summary
Sorting algorithm
An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management
- stars
- 703
- forks
- 19
- watching
- 16
- awesome list
- 1
Similar projects
Found by comparing what the projects do, not just their names.
Sorter
A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data
Sorting algorithm
An efficient sorting algorithm with O(n log n) complexity.
Sorting algorithm implementation
An implementation of the Quicksort sorting algorithm using a custom data structure called Huff.
Sorting algorithm
A C++ implementation of TimSort, an O(n log n) stable sorting algorithm.
Sorting algorithm
An optimized sorting algorithm with O(1) memory usage.
Sorter
A sorting algorithm that optimizes performance on non-random access containers and large data types
String sorter
A fast string sorting algorithm implemented in Go.
Radix Sort
Provides an implementation of radix sort in C and C++ with various optimization techniques.
Sorting algorithm
An implementation of the sorting algorithm known as Ska Sort in C++
swenson/sort464
Sorting library
A comprehensive C sorting library providing various stable and unstable algorithms with generic implementations
Sorting algorithm
A bubble sort algorithm implementation with a comparison function for sorting arrays of elements in ascending or descending order
Sorting library
Provides a collection of algorithms for sorting data in a programming language
Sorting library
Provides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq.
Sorting algorithm
An implementation of a hybrid sorting algorithm with a focus on stability and adaptability
Sorted data library
An implementation of sorted data structures using B-Trees in the Nim programming language
Featured in 1 awesome list
Each link jumps to the spot where the list mentions blitsort.
