Fast O(n) stable sorting algorithm. C++ implementation. It outperforms std::sort and std::stable_sort on N > 100 for both primitive types and complex objects.
Anysort，符合直觉的多属性排序方法，类型完备，Flexible and Full Typed multi-properties sorter for nested objects
Anysort，符合直觉的多属性排序方法，类型完备，Flexible and Full Typed multi-properties sorter for nested objects
🌖 Merging algorithms for JavaScript
Merge Sort algorithm implementation without recursion, using cached binary trees
🍢 Radix sorting algorithms for JavaScript
🐉 Mergesort algorithm for JavaScript
A stable, adaptive block merge sort.
radix-sort implementation for list of various type
Sort A Stable is a fast, in-place sorting algorithm that maintains the order of equal elements. It features two functions, `sort_a_stable_ascending()` and `sort_a_stable_descending()`, for sorting arrays efficiently. 🐙✨
A parallel stable sort using arbitrary extra memory
Add a description, image, and links to the stable-sort topic page so that developers can more easily learn about it.
To associate your repository with the stable-sort topic, visit your repo's landing page and select "manage topics."