1、冒泡排序:
const mySort = function (arr) {
let tmpItem = null
for (let i = 0; i < arr.length - 1; i++) {
for (let j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
tmpItem = arr[j + 1]
arr[j + 1] = arr[j]
arr[j] = tmpItem
}
}
}
return arr
}
2、选择排序:
const mySort2 = function (arr) {
let minIndex, tmpItem
for (let i = 0; i < arr.length; i++) {
minIndex = i
for (let j = i + 1; j < arr.length; j++) {
if (arr[j] < arr[minIndex])
minIndex = j
}
if (minIndex !== i) {
tmpItem = arr[minIndex]
arr[minIndex] = arr[i]
arr[i] = tmpItem
}
}
return arr
}
3、插入排序:
const mySort3 = function (arr) {
let newArr = [arr[0]]
for (let i = 1; i <= arr.length - 1; i++) {
for (let j = newArr.length - 1; j >= 0; j--) {
if (newArr[j] < arr[i]) {
newArr.splice(j + 1, 0, arr[i])
break
}
if (j === 0)
newArr.unshift(arr[i])
}
}
return newArr
}
4、快速排序:
const mySort4 = function (arr) {
if (arr.length === 1 || arr.length === 0)
return arr
let middelIndex = Math.floor(arr.length / 2)
let middleItem = arr.splice(middelIndex, 1)[0]
let leftArr = arr.filter(o => o <= middleItem)
let rightArr = arr.filter(o => o > middleItem)
return mySort4(leftArr).concat([middleItem], mySort4(rightArr))
}