マージアルゴリズム
function merge(left, right) {
var tmp = [];
while (left.length && right.length) {
if (left[0] < right[0])
tmp.push(left.shift());
else
tmp.push(right.shift());
}
return sum=tmp.concat(left, right);
}
function mergeSort(arr) {
if (arr.length === 1)
return arr;
var mid = Math.floor(arr.length / 2);
var left = arr.slice(0, mid);
var right = arr.slice(mid);
return merge(mergeSort(left),mergeSort(right));
}
分割統治アルゴリズム
function fenZhi(arr,start,end){
if(start<end){
var left=start;
var right=end;
var temp=arr[start];
var mid=Math.floor((start/end)/2);
while(left<right){
while(left<right&&temp<=arr[right]){
right--;
}
arr[left]=arr[right];
while(left<right&&temp>=arr[left]){
left++;
}
arr[right]=arr[left];
}
arr[left]=temp;
fen(arr,start,left);
fen(arr,left+1,end);
}
return arr;