-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsort.js
102 lines (76 loc) · 2.13 KB
/
sort.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
const testArray = [2, 4, 7, 1, 3, 564, 6, 122, 5, 657, 67, 8, 12, 12]
// 选择排序
function selectionSort(arr) {
for (let i = 0; i < arr.length - 1; i++) {
let current = arr[i]
for (let q = i + 1; q < arr.length; q++) {
let next = arr[q]
if (current > next) {
arr[i] = next
arr[q] = current
current = next
}
}
}
return arr
}
// console.log(selectionSort(testArray))
// 冒泡排序
function bubbleSort(arr) {
let lastIndex = arr.length - 1
while (lastIndex) {
for (let index = 0; index < lastIndex; index++) {
const element = arr[index]
const next = arr[index + 1]
if (element > next) {
arr[index] = next
arr[index + 1] = element
}
}
lastIndex = lastIndex - 1
}
return arr
}
// console.log(bubbleSort(testArray))
// 插入排序
function insertSort(arr) {
for (let i = 1; i < arr.length; i++) {
let element = arr[i];
let j = i
for (; j > 0; j--) {
if (element < arr[j - 1]) {
arr[j] = arr[j - 1]
} else {
break
}
}
arr[j] = element
}
return arr
}
// console.log(insertSort(testArray))
// 希尔排序
function shellSort(arr) {
let interval = Math.ceil(arr.length / 2)
// 分组间隔逐渐缩小到1
for (; interval >= 1; interval = Math.floor(interval / 2)) {
// 每一组都进行插入排序
for (let i = 0; i < interval; i++) {
// 插入排序
for (let j = i + interval; j < arr.length; j = j + interval) {
let current = arr[j]
let k = j
for (; k > i; k = k - interval) {
if (current < arr[k - interval]) {
arr[k] = arr[k - interval]
} else {
break
}
}
arr[k] = current
}
}
}
return arr
}
console.log(shellSort(testArray))