原生JS数组方法(二)——reverve()、slice()、concat()、sort()

Array.prototype.reverse = function(){
    //用二分法
    for(var i=0;i<this.length/2;i++){
        //解构赋值
        [this[i],this[this.length-1-i]] = [this[this.length-1-i],this[i]]
    }
    return this
}

Array.prototype.Slice =function(n=0,m=this.length){
if(n<=0&&m<0&&this.length+n>this.length+m){
      return [];
  }
  n<0?n = this.length + n:n;
  m<0?m = this.length + m:m;
  m>this.length?m=this.length:m;
  let res =[];
  for(var i=n;i<m;i++){
      res[res.length]=this[i];
  }
  return res;
}

Array.prototype.concat=function(){
    let res=[];
    for(var j=0;j<this.length;j++){
        res[res.length]=this[j]
    }
    for(var i=0;i<arguments.length;i++){
        if({}.toString.call(arguments[i]) === ‘[object Array]‘){
            for(var z=0;z<arguments[i].length;z++){
                res[res.length]=arguments[i][z]
            }
        }else{
            res[res.length]=arguments[i]
        }

    }
    return res;
}

Array.prototype.sort=function(compare){
    //判断传入的是不是函数
      if(typeof compare !== "function"&& compare !== undefined){
        throw new Error( " The comparison function must be either a function or undefined" +
            "at Array.sort (native)" );
    }
     for (var i = 0; i < this.length-1; i++) {
        for (var j = 0; j < this.length-1-i; j++) {
            //传入回调函数走这里
            if(compare){
                //a-b和b-a都是大于0才换位置
                if(compare(this[j],this[j+1])>0){
                    [this[j],this[j+1]] = [this[j+1],this[j]]
                }
                //不传回调走这里，按首个数字排序
            }else{
                if((this[j]+"")[0] - (this[j+1]+"")[0] > 0 ){
                    [this[j],this[j+1]] = [this[j+1],this[j]]
                }
            }

        }
    }
}