数组二分法

function quickSort(obj){
       if(obj.length<=1){
          return obj;
      } 
    //取得数组中间的值
 var nowMidder=obj.splice(Math.floor(obj.length/2),1);
 var leftArr = [];
 var reightArr = []; 
 for(var i=0;i