<script>
function
mergeSort(arr , n) {
var
curr_size;
var
left_start;
for
(curr_size = 1; curr_size <= n - 1; curr_size = 2 * curr_size) {
for
(left_start = 0; left_start < n - 1; left_start += 2 * curr_size) {
var
mid = Math.min(left_start + curr_size - 1, n - 1);
var
right_end = Math.min(left_start + 2 * curr_size - 1, n - 1);
merge(arr, left_start, mid, right_end);
}
}
}
function
merge(arr , l , m , r) {
var
i, j, k;
var
n1 = m - l + 1;
var
n2 = r - m;
var
L = Array(n1).fill(0);
var
R = Array(n2).fill(0);
for
(i = 0; i < n1; i++)
L[i] = arr[l + i];
for
(j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while
(i < n1 && j < n2) {
if
(L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
while
(i < n1) {
arr[k] = L[i];
i++;
k++;
}
while
(j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
function
printArray(A , size) {
var
i;
for
(i = 0; i < size; i++)
document.write( A[i]+
" "
);
document.write(
"<br/>"
);
}
var
arr = [-74,48,-20,2,10,-84,-5,-9,11,-24,-91,2,-71,64,63,80,28,-30,-58,-11,-44,-87,-22,54,-74,-10,-55,-28,-46,29,10,50,-72,34,26,25,8,51,13,30,35,-8,50,65,-6,16,-2,21,-78,35,-13,14,23,-3,26,-90,86,25,-56,91,-13,92,-25,37,57,-20,-69,98,95,45,47,29,86,-28,73,-44,-46,65,-84,-96,-24,-12,72,-68,93,57,92,52,-45,-2,85,-63,56,55,12,-85,77,-39];
var
n = arr.length;
document.write(
"Given array is <br/>"
);
printArray(arr, n);
mergeSort(arr, n);
document.write(
"<br/>Sorted array is <br/>"
);
printArray(arr, n);
</script>