JS版本 冒泡排序，快速排序

/**
 * 冒泡排序
 */
function bubbleSort(arr) {
  var didswap;

  for (var i = 0; i < arr.length - 1; i++) {
    didswap = false;

    for (var j = 0; j < arr.length - 1 - i; j++) {
      if (arr[j] > arr[j + 1]) {
        swap(arr, j, j + 1);
        didswap = true;
      }
    }

    if (!didswap) return;
  }
}

function swap(arr, i, j) {
  var temp = arr[i];
  arr[i] = arr[j];
  arr[j] = temp;
}

/**
 * 快速排序
 */
function Quicksort(arr, Left, Right) {

  var left = Left;
  var right = Right;
  var middle = arr[Math.floor((Left + Right) / 2)];

  while (left <= right) {
    while (left < Right && arr[left] < middle) {
      left++;
    }
    while (Left < right && arr[right] > middle) {
      right--;
    }

    if (left <= right) {
      var temp = arr[left];
      arr[left] = arr[right];
      arr[right] = temp;

      left++;
      right--;
    }
  }

  if (Left < right)
    Quicksort(arr, Left, right);

  if (left < Right)
    Quicksort(arr, left, Right);

}