js实现常用排序算法

 var bubbleSort = function (arr) {
 var flag = true;
 var len = arr.length;
 for (var i = 0; i  arr[j + 1]) {
    var temp = arr[j+1];
    arr[j+1] = arr[j];
    arr[j] = temp;
    flag = false;
   }
  }
  if (flag) {
   break;
  }
 }
}; 

 var selectSort = function (arr) {
 var min;
 for (var i = 0; i  arr[j]) {
    min = j;
   }
  }
  if (i != min) {
   swap(arr, i, min);
  }
 }
};
function swap(arr, index1, index2) {
 var temp = arr[index1];
 arr[index1] = arr[index2];
 arr[index2] = temp;
}; 

 var insertSort = function (arr) {
 var len = arr.length, key;
 for (var i = 1; i  -1) {
   if (arr[j] > key) {
    arr[j + 1] = arr[j];
   } else {
    break;
   }
  }
  arr[j + 1] = key;
 }
}; 

 var shellSort = function (arr) {
 var gaps = [5, 3, 1];
 for (var g = 0; g = gaps[g] && arr[j - gaps[g]] > temp; j -= gaps[g]) {
    arr[j] = arr[j - gaps[g]];
   }
   arr[j] = temp;
  }
 }
}; 

 function mergeSort(arr) {
 if (arr.length <2) {
  return;
 }
 var step = 1;
 var left, right;
 while (step 

 var quickSort = function(arr, left, right) {
 var i, j, t, pivot;
 if (left >= right) {
  return;
 }
 pivot = arr[left];
 i = left;
 j = right;
 while (i != j) {
  while (arr[j] >= pivot && i