blitsort
Sorting algorithm
An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management
Blitsort is an in-place stable adaptive rotate mergesort / quicksort.
701 stars
16 watching
19 forks
Language: C
last commit: 4 months ago
Linked from 1 awesome list
algorithmbranchlesscinplacemergequicksortsorting
uhub/awesome-cRelated projects:
| Repository | Description | Stars |
|---|---|---|
| scandum/quadsort | A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data | 2,135 |
 stoeffel/mergesort | An efficient sorting algorithm with O(n log n) complexity. | 20 |
 0xdewy/quicksort-huff | An implementation of the Quicksort sorting algorithm using a custom data structure called Huff. | 10 |
 timsort/cpp-timsort | A C++ implementation of TimSort, an O(n log n) stable sorting algorithm. | 299 |
 bonzaithepenguin/wikisort | An optimized sorting algorithm with O(1) memory usage. | 1,268 |
 mattreecebentley/plf_indiesort | A sorting algorithm that optimizes performance on non-random access containers and large data types | 19 |
 yourbasic/radix | A fast string sorting algorithm implemented in Go. | 192 |
 bitshifter/radixsort | Provides an implementation of radix sort in C and C++ with various optimization techniques. | 6 |
 skarupke/ska_sort | An implementation of the sorting algorithm known as Ska Sort in C++ | 235 |
 swenson/sort | A comprehensive C sorting library providing various stable and unstable algorithms with generic implementations | 463 |
 addyosmani/bubblesort | A bubble sort algorithm implementation with a comparison function for sorting arrays of elements in ascending or descending order | 106 |
 wildgums/orc.sort | Provides a collection of algorithms for sorting data in a programming language | 17 |
 pi8027/stablesort | Provides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq. | 22 |
 marijnfs/zigtimsort | An implementation of a hybrid sorting algorithm with a focus on stability and adaptability | 5 |
 narimiran/sorta | An implementation of sorted data structures using B-Trees in the Nim programming language | 17 |