三种排序
1.冒泡排序
for (var i = 0; i < arr1.length - 1; i++) {
for (var j = 0; j < arr1.length - 1 - i; j++) {
if (arr1[j] > arr1[j + 1]) {
num1 = arr1[j]
arr1[j] = arr1[j + 1]
arr1[j + 1] = num1
}
}
}
2.选择排序
for (var i = 0; i < arr1.length; i++) {
var nu = i
for (j = 0; j < arr1.length; j++) {
if (arr1[j] > arr1[nu]) {
nu = j
var num = arr1[i]
arr1[i] = arr1[nu]
arr1[nu] = num
}
}
}
3.插入排序
for (var i = 1; i < arr1.length - 1; i++) {
var a = i - 1
var b = arr1[i]
while (a > 0 && arr1[a] > b) {
arr1[a + 1] = arr1[a]
a--
}
arr1[a + 1] = b
}