WikiSort

Sorting algorithm

An optimized sorting algorithm with O(1) memory usage.

Fast and stable sort algorithm that uses O(1) memory. Public domain.

GitHub

1k stars
49 watching
95 forks
Language: C++
last commit: almost 5 years ago

Related projects:

RepositoryDescriptionStars
mattreecebentley/plf_indiesortA sorting algorithm that optimizes performance on non-random access containers and large data types19
timsort/cpp-timsortA C++ implementation of TimSort, an O(n log n) stable sorting algorithm.303
addyosmani/bubblesortA bubble sort algorithm implementation with a comparison function for sorting arrays of elements in ascending or descending order107
morwenn/cpp-sortA C++14 header-only sorting library providing a flexible and generic way to implement various sorting algorithms629
wildgums/orc.sortProvides a collection of algorithms for sorting data in a programming language17
stoeffel/mergesortAn efficient sorting algorithm with O(n log n) complexity.20
scandum/blitsortAn in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management703
dogweather/naturallyAn algorithm to sort strings according to natural ordering with support for hierarchical identifiers and Unicode characters87
pi8027/stablesortProvides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq.22
0xdewy/quicksort-huffAn implementation of the Quicksort sorting algorithm using a custom data structure called Huff.10
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
jfcg/sortyFast and efficient sorting library for Go with concurrent and parallel capabilities133
yourbasic/radixA fast string sorting algorithm implemented in Go.192
marijnfs/zigtimsortAn implementation of a hybrid sorting algorithm with a focus on stability and adaptability6