排序、冒泡排序、快速排序

1、利用sort()实现排序

 function act(a,b) {
         return a.value-b.value
     }
    var b= arr.sort(act)
 var arr = [{ name: '张三', value: 12 }, 
    { name: '李四', value: 13 }, 
    { name: '王五', value: 14 },
     { name: '刘丹', value: 15 },
     { name: '刘丹11', value: 10 } ];
     function act(a,b) {
         return a.value-b.value
     }
    var b= arr.sort(function (a,b) {
        return a.value-b.value
    })

方法二：冒泡排序

// for(var i=0;i<arr.length;i++){
    //     for(var j=0;j<arr.length-i-1;j++){
    //         var temp=arr[j].value;
    //         if(arr[j+1].value<temp){
    //             temp=arr[j]
    //             arr[j]=arr[j+1];
    //             arr[j+1]=temp
    //         }
    //     }
    // }
    // console.log(arr);
   console.log(b);

快速排序，也称二分式

   var paints = [40, 100, 1, 5, 25, 10];
    var sort = function (arr, low, high) {
      var base = arr[low]
      while (low < high) {
        while (low < high && arr[high] > base) {
          high--
        }
        arr[low] = arr[high]  
        while (low < high && arr[low] < base) {
          low++
        }
        arr[high] = arr[low]  
      }
      arr[low] = base
      return low
    }
    var quiteSort = function (arr, low, high) {
      if (low < high) {
        var index = sort(arr, low, high)
        quiteSort(arr, low, index - 1)
        quiteSort(arr, index + 1, high)
      }
    }
    quiteSort(paints, 0, paints.length - 1)