js快速排序与冒泡排序

1. 快速排序

   function quickSort(arr){
       if (arr.length <= 1) return arr;
       var pivotIndex = Math.floor(arr.length/2);
       var pivot = arr.splice(pivotIndex,1)[0];
       var left = [];
       var right = [];
       for (let i = 0; i < arr.length; i++) {
           if (arr[i] < pivot) {
               left.push(arr[i])
           } else {
               right.push(arr[i])
           }
       }
       return quickSort(left).concat([pivot],quickSort(right))
   }}
   

2. 冒泡排序

   function sort(arr){
       var temp = null;
       for (var i = 0;i < arr.length-1; i++){
           for (var j = i + 1; j < arr.length; j++) {
               if (arr[i] > arr[j]) {
                   temp = arr[j];
                   arr[j] = arr[i];
                   arr[i] = temp;
               }
           }
       }
   }