forked from lazy-b/algorithmNote
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbubbleSort.js
More file actions
116 lines (101 loc) · 2.11 KB
/
Copy pathbubbleSort.js
File metadata and controls
116 lines (101 loc) · 2.11 KB
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
// 冒泡排序算法 1
const bubbleSort1 = arr => {
const len = arr.length;
for (let i = 0; i < len - 1; i++) {
for (let j = 0; j < len - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
[arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
}
}
}
return arr;
};
// 冒泡排序算法 2
const bubbleSort2 = arr => {
const len = arr.length;
for (let i = 0; i < len - 1; i++) {
let sorted = true;
for (let j = 0; j < len - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
[arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
sorted = false;
}
}
// 已经有序
if (sorted) {
break;
}
}
return arr;
};
// 冒泡排序算法 3
const bubbleSort3 = arr => {
const len = arr.length;
let flag = len;
let sortBorder = len - 1;
for (let i = 0; i < len - 1; i++) {
let sorted = true;
for (let j = 0; j < sortBorder; j++) {
if (arr[j] > arr[j + 1]) {
[arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
sorted = false;
flag = j;
}
}
sortBorder = flag;
// 已经有序
if (sorted) {
break;
}
}
return arr;
};
// 冒泡排序算法 4 - 鸡尾酒排序
const bubbleSort4 = arr => {
const len = arr.length;
let min = 0;
let max = len - 1;
// 正向
let turn = true;
// 有序区标志位，较少无用循环
let flag = len;
while (max >= min) {
let sorted = true;
// 正向轮
if (turn) {
for (let i = min; i < max; i++) {
if (arr[i] > arr[i + 1]) {
[arr[i + 1], arr[i]] = [arr[i], arr[i + 1]];
sorted = false;
flag = i;
}
}
max = flag;
// max--;
// 逆向轮
} else {
for (let i = max; i > min + 1; i--) {
if (arr[i - 1] > arr[i]) {
[arr[i - 1], arr[i]] = [arr[i], arr[i - 1]];
sorted = false;
flag = i;
}
}
min = flag;
// min++;
}
// 反向
turn = !turn;
// 提前结束排序
if (sorted) {
break;
}
}
return arr;
};
module.exports = {
bubbleSort1,
bubbleSort2,
bubbleSort3,
bubbleSort4,
};