quadsort
by scandum
Quadsort is a branchless stable adaptive mergesort faster than quicksort.
AI summary
Sorter
A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data
- stars
- 2.1K
- forks
- 105
- watching
- 42
- awesome list
- 1
Similar projects
Found by comparing what the projects do, not just their names.
Sorting algorithm
An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management
Sorting algorithm implementation
An implementation of the Quicksort sorting algorithm using a custom data structure called Huff.
Sorting algorithm
An efficient sorting algorithm with O(n log n) complexity.
String sorter
A fast string sorting algorithm implemented in Go.
Sorter
A sorting algorithm that optimizes performance on non-random access containers and large data types
Radix Sort
Provides an implementation of radix sort in C and C++ with various optimization techniques.
Sorting library
Provides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq.
Sorting algorithm
A C++ implementation of TimSort, an O(n log n) stable sorting algorithm.
Sorter
A plugin that simplifies text sorting in Neovim by providing an intuitive command-line interface for both line-wise and delimiter-based sorting.
Sortable list mixin
A set of Vue mixins to turn any list into an animated, touch-friendly, sortable list
Natural Sorter
An extension to StringComparison that adds support for natural sorting of strings
Sorter
A collection of reusable sorting utilities in Swift
Sorting algorithm
An optimized sorting algorithm with O(1) memory usage.
Sorter
A sorting function for natural ordering of strings containing numbers
jfcg/sorty133
Sorting library
Fast and efficient sorting library for Go with concurrent and parallel capabilities
Featured in 1 awesome list
Each link jumps to the spot where the list mentions quadsort.
