cpp-TimSort

Sorting algorithm

A C++ implementation of TimSort, an O(n log n) stable sorting algorithm.

A C++ implementation of timsort

GitHub

303 stars
18 watching
46 forks
Language: C++
last commit: almost 2 years ago
Linked from 2 awesome lists

algorithmc-plus-plussortsorting

Backlinks from these awesome lists:

Related projects:

RepositoryDescriptionStars
morwenn/cpp-sortA C++14 header-only sorting library providing a flexible and generic way to implement various sorting algorithms629
bonzaithepenguin/wikisortAn optimized sorting algorithm with O(1) memory usage.1,273
stoeffel/mergesortAn efficient sorting algorithm with O(n log n) complexity.20
mattreecebentley/plf_indiesortA sorting algorithm that optimizes performance on non-random access containers and large data types19
pi8027/stablesortProvides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq.22
scandum/blitsortAn in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management703
swenson/sortA comprehensive C sorting library providing various stable and unstable algorithms with generic implementations464
skarupke/ska_sortAn implementation of the sorting algorithm known as Ska Sort in C++235
marijnfs/zigtimsortAn implementation of a hybrid sorting algorithm with a focus on stability and adaptability6
scandum/quadsortA branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data2,137
proalgos/proalgos-cppC++ implementations of algorithms and data structures514
0xdewy/quicksort-huffAn implementation of the Quicksort sorting algorithm using a custom data structure called Huff.10
thekvs/cpp-serializersCompares performance of various data serialization libraries in C++731
petarv-/algorithmsA collection of C++ implementations of various algorithms and data structures648
bitshifter/radixsortProvides an implementation of radix sort in C and C++ with various optimization techniques.6