-
-
Save xieyunzi/e5284007f3d1c2a0bcb3884bab9d8e63 to your computer and use it in GitHub Desktop.
inplace merge sort
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// inplace merge sort | |
// http://thomas.baudel.name/Visualisation/VisuTri/inplacestablesort.html | |
(function () { | |
"use strict"; | |
var floor = Math.floor; | |
function lower(a, from, to, value, compare) { | |
while (to > from) { | |
var middle = from + floor((to - from) / 2); | |
if (compare(a[middle], value) < 0) { | |
from = middle + 1; | |
} else { | |
to = middle; | |
} | |
} | |
return from; | |
} | |
function upper(a, from, to, value, compare) { | |
while (to > from) { | |
var middle = from + floor((to - from) / 2); | |
if (compare(value, a[middle]) < 0) { | |
to = middle; | |
} else { | |
from = middle + 1; | |
} | |
} | |
return from; | |
} | |
function reverse(a, from, to) { | |
--from; | |
while (++from < --to) { | |
var tmp = a[from]; | |
a[from] = a[to]; | |
a[to] = tmp; | |
} | |
} | |
function rotate(a, from, pivot, to) { | |
if (from < pivot && pivot < to) { | |
reverse(a, from, pivot); | |
reverse(a, pivot, to); | |
reverse(a, from, to); | |
} | |
} | |
function merge(a, from, pivot, to, compare) { | |
if (from < pivot && pivot < to && compare(a[pivot], a[pivot - 1]) < 0) { | |
if (to - from === 2) { | |
reverse(a, from, to); | |
} else { | |
var firstCut = 0; | |
var secondCut = 0; | |
if (pivot - from > to - pivot) { | |
firstCut = from + floor((pivot - from) / 2); | |
secondCut = lower(a, pivot, to, a[firstCut], compare); | |
} else { | |
secondCut = pivot + floor((to - pivot) / 2); | |
firstCut = upper(a, from, pivot, a[secondCut], compare); | |
} | |
console.log(`a: ${a}, firstCut: ${firstCut}, pivot: ${pivot}, secondCut: ${secondCut}`) | |
rotate(a, firstCut, pivot, secondCut); | |
console.log(`a: ${a}, firstCut: ${firstCut}, pivot: ${pivot}, secondCut: ${secondCut}`) | |
var middle = secondCut - pivot + firstCut; | |
merge(a, middle, secondCut, to, compare); | |
merge(a, from, firstCut, middle, compare); | |
} | |
} | |
} | |
function mergeSort(a, from, to, compare) { | |
if (to - from > 1) { | |
var middle = from + floor((to - from) / 2); | |
console.log(`middle: ${middle}, from: ${from}, to: ${to}`) | |
mergeSort(a, from, middle, compare); | |
mergeSort(a, middle, to, compare); | |
merge(a, from, middle, to, compare); | |
} | |
} | |
Object.defineProperty(Array.prototype, "inPlaceMergeSort", { | |
writable: true, | |
enumerable: false, | |
configurable: true, | |
value: function (compare) { | |
mergeSort(this, 0, this.length, compare); | |
return this; | |
} | |
}); | |
}()); | |
console.log( | |
[7, 9, 8, 5, 3, 4, 6, 1, 2, 0].inPlaceMergeSort(function(a, b){ | |
if (a < b) { | |
return -1 | |
} else if (a === b) { | |
return 0 | |
} else { | |
return 1 | |
} | |
}) | |
) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment