quadsort
Sorter
A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data
Quadsort is a branchless stable adaptive mergesort faster than quicksort.
2k stars
42 watching
105 forks
Language: C
last commit: about 2 years agoLinked from 1 awesome list
algorithmcimplementationmergequicksortsortingtimsortvisualization
uhub/awesome-cRelated projects:
| Repository | Description | Stars |
|---|---|---|
| scandum/blitsort | An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management | 703 |
 0xdewy/quicksort-huff | An implementation of the Quicksort sorting algorithm using a custom data structure called Huff. | 10 |
 stoeffel/mergesort | An efficient sorting algorithm with O(n log n) complexity. | 20 |
 yourbasic/radix | A fast string sorting algorithm implemented in Go. | 192 |
 mattreecebentley/plf_indiesort | A sorting algorithm that optimizes performance on non-random access containers and large data types | 19 |
 bitshifter/radixsort | Provides an implementation of radix sort in C and C++ with various optimization techniques. | 6 |
 pi8027/stablesort | Provides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq. | 22 |
 timsort/cpp-timsort | A C++ implementation of TimSort, an O(n log n) stable sorting algorithm. | 303 |
 sqve/sort.nvim | A plugin that simplifies text sorting in Neovim by providing an intuitive command-line interface for both line-wise and delimiter-based sorting. | 137 |
 jexordexan/vue-slicksort | A set of Vue mixins to turn any list into an animated, touch-friendly, sortable list | 1,482 |
 tompazourek/naturalsort.extension | An extension to StringComparison that adds support for natural sorting of strings | 175 |
 dsmatter/swiftsortutils | A collection of reusable sorting utilities in Swift | 61 |
 bonzaithepenguin/wikisort | An optimized sorting algorithm with O(1) memory usage. | 1,273 |
 dancouper/natural_sort | A sorting function for natural ordering of strings containing numbers | 14 |
 jfcg/sorty | Fast and efficient sorting library for Go with concurrent and parallel capabilities | 133 |