Javascript中常用的排序算法(实例)

function selectSort(array) {
 var index, temp;

 for (var i = 0; i < array.length - 1; i++) {
  index = i;
  temp = array[i];
  for (var j = i + 1; j < array.length; j++) {
   if (temp > array[j]) {
    index = j;
    temp = array[j];
   }
  }
  array[index] = array[i];
  array[i] = temp;
 }
 return array;
}

// test
var test = [2, 1, 22, 64, 4, 12, 56, 89, 7, 9, 85];
console.log(selectSort(test));1.2.3.4.5.6.7.8.9.10.11.12.13.14.15.16.17.18.19.20.21.22.

function insertSort(array) {
 var len = array.length;
 var temp;

 for (var i = 1; i < len; i++) {
  temp = array[i];
  for (var j = i - 1; j >= 0 && temp < array[j]; j--) {
   array[j+1] = array[j];
  }
  array[j+1] = temp;
 }
 return array;
}

// test
var test = [1, 2, 22, 64, 4, 12, 56, 89, 7, 9, 85];
console.log(insertSort(test)); // [1, 2, 4, 7, 9, 12, 22, 56, 64, 85, 89] 1.2.3.4.5.6.7.8.9.10.11.12.13.14.15.16.17.18.