WikiSort
Sorting algorithm
An optimized sorting algorithm with O(1) memory usage.
Fast and stable sort algorithm that uses O(1) memory. Public domain.
1k stars
50 watching
95 forks
Language: C++
last commit: almost 3 years ago Related projects:
| Repository | Description | Stars |
|---|---|---|
 mattreecebentley/plf_indiesort | A sorting algorithm that optimizes performance on non-random access containers and large data types | 19 |
 timsort/cpp-timsort | A C++ implementation of TimSort, an O(n log n) stable sorting algorithm. | 299 |
 addyosmani/bubblesort | A bubble sort algorithm implementation with a comparison function for sorting arrays of elements in ascending or descending order | 106 |
 morwenn/cpp-sort | A C++14 header-only sorting library providing a flexible and generic way to implement various sorting algorithms | 622 |
 wildgums/orc.sort | Provides a collection of algorithms for sorting data in a programming language | 17 |
 stoeffel/mergesort | An efficient sorting algorithm with O(n log n) complexity. | 20 |
 scandum/blitsort | An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management | 701 |
 dogweather/naturally | An algorithm to sort strings according to natural ordering with support for hierarchical identifiers and Unicode characters | 87 |
 pi8027/stablesort | Provides a modular and canonical way to prove the correctness of stable sorting algorithms in Coq. | 22 |
 0xdewy/quicksort-huff | An implementation of the Quicksort sorting algorithm using a custom data structure called Huff. | 10 |
 swenson/sort | A comprehensive C sorting library providing various stable and unstable algorithms with generic implementations | 463 |
 skarupke/ska_sort | An implementation of the sorting algorithm known as Ska Sort in C++ | 235 |
 jfcg/sorty | Fast and efficient sorting library for Go with concurrent and parallel capabilities | 133 |
 yourbasic/radix | A fast string sorting algorithm implemented in Go. | 192 |
 marijnfs/zigtimsort | An implementation of a hybrid sorting algorithm with a focus on stability and adaptability | 5 |