常见排序算法 about blog HOT 2 OPEN

var bubbleSort= function (nums) {
  var len = nums.length
  for (var i = 0; i < len - 1; i++) {
    for (var j = 0; j < len - i - 1; j++) {
      if (nums[j] > nums[j + 1]) {
        var temp = nums[j]
        nums[j] = nums[j + 1]
        nums[j + 1] = temp
      }
    }
  }
  return nums
};

function cockTailSort(nums) {
    var start = 0
    var end = nums.length - 1;
    var temp;
    while (start < end) {
        //注意i的取值范围[star, end), 半开半闭
        for (var i = start; i < end; i++) {
            if (nums[i] > nums[i + 1]) {
                temp = nums[i];
                nums[i] = nums[i + 1];
                nums[i + 1] = temp;
            }
        }
        end--;
        //注意i的取值范围(star, end], 半开半闭
        for (var i = end; i > start; i--) {
            if (nums[i - 1] > nums[i]) {
                temp = nums[i];
                nums[i] = nums[i - 1];
                nums[i - 1] = temp;
            }
        }
        start++;
    }
    return nums
}

function insertionSort (nums) {
    var len = nums.length
    for (var i = 0; i < len; i++) {
        var num = nums[i]
        //注意j的起始值
        var j = i - 1
        while (j >= 0 && nums[j] > num) {
            nums[j + 1] = nums[j]
            j--
        }
        //注意此处的下标
        nums[j + 1] = num
    }
    return nums
};