js希尔排序

function shellSort (arr) {
    var len = arr.length;
    var  increment = Math.floor(len/2);
    while(increment!=0) {
        for (var i = increment;i < len;i++){
            var temp = arr[i]
            for(var j = i - increment;j >= 0 && temp < arr[j];j -= increment){
              arr[j + increment] = arr[j]
            }
            arr[j + increment] =  temp;
        }
        increment = Math.floor(increment / 2)
    }
    return arr;
}

转载于:https://www.cnblogs.com/CoderZX/p/10500814.html