Node‑TimSort is a pure‑JavaScript implementation of the adaptive, stable TimSort algorithm for Node.js (and Bower). It provides a drop‑in `TimSort.sort` function that outperforms the built‑in `Array.prototype.sort` on partially ordered or large arrays and guarantees stability, making it useful for developers who need fast, reliable sorting of numbers or objects in server‑side JavaScript.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mziccard/node-timsort
Custom parser for ESLint
The JavaScript Task Runner
Adds a simple banner to files
simple, flexible, fun test framework
Support the repos that depend on this repository
Top contributors
mziccard
18 contributions
novacrazy
14 contributions
kasperisager
2 contributions
![dependabot[bot]'s profile](https://avatars.githubusercontent.com/dependabot[bot])
dependabot[bot]
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet