4 * Merge sort (http://en.wikipedia.org/wiki/Merge_sort)
6 function mergeSort(arr, compareFn) {
9 } else if (arr.length < 2) {
13 if (compareFn == null) {
14 compareFn = defaultCompare;
19 mid = ~~(arr.length / 2);
20 left = mergeSort( arr.slice(0, mid), compareFn );
21 right = mergeSort( arr.slice(mid, arr.length), compareFn );
23 return merge(left, right, compareFn);
26 function defaultCompare(a, b) {
27 return a < b ? -1 : (a > b? 1 : 0);
30 function merge(left, right, compareFn) {
33 while (left.length && right.length) {
34 if (compareFn(left[0], right[0]) <= 0) {
35 // if 0 it should preserve same order (stable)
36 result.push(left.shift());
38 result.push(right.shift());
43 result.push.apply(result, left);
47 result.push.apply(result, right);