A JavaScript Heapsort implementation with O(nlog n) complexity.
Starting from v0.2.0 this package fully moved to ES Modules and ES2015 code. This means no more build step before publishing to NPM.
Ideally you shouldn't spot any difference, but in case you face any issues, see this useful article.
You can also downgrade to v0.1.2 to use all the same functionality, precompiled to ES5.
npm install heapsort
import heapsort from 'heapsort';
heapsort(array[, comparator]);
If you need to save the original array you should pass a copy, because heapsort will mutate it.
Comparator is a function which compares two elements and returns 0, 1 or -1. Read more about comparator
MIT License (c) Alexey Raspopov