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

radix-sort implementation for list of various type

A stable, adaptive block merge sort.

A parallel stable sort using arbitrary extra memory