 cpp-TimSort
 cpp-TimSort 
 Sorting algorithm
 A C++ implementation of TimSort, an O(n log n) stable sorting algorithm.
A C++ implementation of timsort
303 stars
 18 watching
 46 forks
 
Language: C++ 
last commit: 11 months ago 
Linked from   2 awesome lists  
  algorithmc-plus-plussortsorting 
 Related projects:
| Repository | Description | Stars | 
|---|---|---|
|  | A C++14 header-only sorting library providing a flexible and generic way to implement various sorting algorithms | 629 | 
|  | An optimized sorting algorithm with O(1) memory usage. | 1,273 | 
|  | An efficient sorting algorithm with O(n log n) complexity. | 20 | 
|  | A sorting algorithm that optimizes performance on non-random access containers and large data types | 19 | 
|  | Provides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq. | 22 | 
|  | An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management | 703 | 
|  | A comprehensive C sorting library providing various stable and unstable algorithms with generic implementations | 464 | 
|  | An implementation of the sorting algorithm known as Ska Sort in C++ | 235 | 
|  | An implementation of a hybrid sorting algorithm with a focus on stability and adaptability | 6 | 
|  | A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data | 2,137 | 
|  | C++ implementations of algorithms and data structures | 514 | 
|  | An implementation of the Quicksort sorting algorithm using a custom data structure called Huff. | 10 | 
|  | Compares performance of various data serialization libraries in C++ | 731 | 
|  | A collection of C++ implementations of various algorithms and data structures | 648 | 
|  | Provides an implementation of radix sort in C and C++ with various optimization techniques. | 6 |