forked from TamimEhsan/AlgorithmVisualizer
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsortingAlgorithms.js
More file actions
154 lines (148 loc) · 3.77 KB
/
sortingAlgorithms.js
File metadata and controls
154 lines (148 loc) · 3.77 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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
export function bubbleSort2(rects ){
const pairs = [];
const num = rects.length;
const prevRect = rects.slice();
for( let i = 0; i<num; i++ ){
for( let j = i+1;j<num;j++ ){
if( prevRect[i].width>prevRect[j].width ){
const recti = {...prevRect[i]};
const rectj = {...prevRect[j]};
prevRect[j] = recti;
prevRect[i] = rectj;
pairs.push( {
xx:i,
yy:j,
changed:true
} );
} else{
pairs.push( {
xx:i,
yy:j,
changed:false
});
}
if( j === num-1 ){
pairs.push( {
xx:i,
yy:i,
changed:false
});
}
}
}
return pairs;
}
export function selectionSort(arr) {
const pairs = [];
let n = arr.length;
const prevRect = arr.slice();
// One by one move boundary of unsorted subarray
for (let i = 0; i < n-1; i++)
{
let min_idx = i;
for (let j = i+1; j < n; j++){
pairs.push( {
xx:min_idx,
yy:j,
changed:false
} );
if (prevRect[j].width < prevRect[min_idx].width){
min_idx = j;
}
}
// Swap the found minimum element with the first
// element
const recti = {...prevRect[i]};
const rectj = {...prevRect[min_idx]};
prevRect[min_idx] = recti;
prevRect[i] = rectj;
pairs.push( {
xx:min_idx,
yy:i,
changed:true
} );
pairs.push( {
xx:i,
yy:i,
changed:false
});
}
pairs.push({
xx:n-1,
yy:n-1,
changed:false
}
)
return pairs;
}
export function bubbleSort(arr){
const pairs= [];
let n = arr.length;
const prevRect = arr.slice();
for (let i = 0; i < n-1; i++){
for (let j = 0; j < n-i-1; j++){
if (prevRect[j].width > prevRect[j+1].width) {
// swap arr[j+1] and arr[j]
const recti = {...prevRect[j]};
const rectj = {...prevRect[j+1]};
prevRect[j+1] = recti;
prevRect[j] = rectj;
pairs.push( {
xx:j,
yy:j+1,
changed:true
} );
} else{
pairs.push( {
xx:j,
yy:j+1,
changed:false
} );
}
if( j === n-i-2 ){
pairs.push( {
xx:n-i-1,
yy:n-i-1,
changed:false
} );
}
}
}
pairs.push({
xx:0,
yy:0,
changed:false
}
)
return pairs;
}
export function insertionSort(arr){
const pairs = [];
let n = arr.length;
const prevRect = arr.slice();
for (let i = 1; i < n; ++i) {
let key = prevRect[i].width;
let j = i - 1;
while (j >= 0 && prevRect[j].width > key) {
const recti = {...prevRect[j]};
const rectj = {...prevRect[j+1]};
prevRect[j+1] = recti;
prevRect[j] = rectj;
pairs.push( {
xx:j,
yy:j+1,
changed:true
} );
j = j - 1;
}
// arr[j + 1] = arr[i];
}
for(let i=0;i<n;i++){
pairs.push({
xx:i,
yy:i,
changed:true
})
}
return pairs;
}