The repository provides a tiny, reusable JavaScript implementation of the merge‑sort algorithm that sorts an array in O(n log n) time. It’s aimed at developers who need a simple, well‑tested sorting utility for front‑end or Node.js projects without pulling in larger libraries.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of joaonuno/merge-sort-js
simple, flexible, fun test framework
BDD/TDD assertion library for node.js and the browser. Test framework agnostic.
Support the repos that depend on this repository
Top contributors
joaonuno
5 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet