mergesort
Mergesort with complexity O(n log n).
Installation
npm install divide-et-impera
Usage
var mergesort = ; // Sort an array; // => [1, 2, 2, 3, 4] var unsorted = 3 -2 5;var sorted = ;// unsorted => [3, -2, 5]// sorted => [-2, 3, 5] // Use a custom comparator { return b - a;}; // => [4, 3, 2, 2, 1] // Use with compare.jsvar desc = ;var date = ;var dates = '01.01.2014' '30.03.2015' '18.01.2015'; ; // => ['30.03.2015', '18.01.2015', '01.01.2014']