node-sort-merge

node-sort-merge JS library on GitHub node-sort-merge JS library on npm Download node-sort-merge JS library

Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.

Version 1.0.3 License MIT
node-sort-merge has no homepage
node-sort-merge JS library on GitHub
node-sort-merge JS library on npm
Download node-sort-merge JS library