归并排序

function fMergeSort(arr,first,last,aTemp){
    if(first > last){
        throw new Error(‘first should less than last‘);
    }
    //取中对数组进行二分
    var mid = (first + last)/2;
    fMergeSort(arr,first,mid,aTemp);
    fMergeSort(arr,mid+1,last,aTemp);
    fMergeArray(arr,first,mid,last,aTemp);
}

function fMergeArray(arr,first,mid,last,aTemp){
    var k = 0,
        left = first,leftEnd = mid,
        right = mid+1,rightEnd = last;
    //将左右数组中较小者优先复制到临时数组
    while(left <= leftEnd && right <= rightEnd){
        if(arr[left] <= a[right]){
            aTemp[k++] = arr[left++];
        } 
        else{
            aTemp[k++] = arr[right++];
        }
    }
    //将left或right剩余元素复制到临时数组，left或right只会有一个剩余
    while(left <= leftEnd){
        aTemp[k++] = arr[left++];
    }
    while(right <= rightEnd){
        aTemp[k++] = arr[right++];
    }
    //将临时数组元素复制到元素数组中
    for(var i=0;i<k;i++){
        arr[first+i] = aTemp[i];
    }
}