forked from TheAlgorithms/JavaScript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBubbleSort.js
94 lines (85 loc) · 2.26 KB
/
BubbleSort.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
/* Bubble Sort is an algorithm to sort an array. It
* compares adjacent element and swaps thier position
* The big O on bubble sort in worst and best case is O(N^2).
* Not efficient.
*
* In bubble sort, we keep iterating while something was swapped in
* the previous inner-loop iteration. By swapped I mean, in the
* inner loop iteration, we check each number if the number proceeding
* it is greater than itself, if so we swap them.
*
* Wikipedia: https://en.wikipedia.org/wiki/Bubble_sort
* Animated Visual: https://www.toptal.com/developers/sorting-algorithms/bubble-sort
*/
/*
* Doctests
*
* > bubbleSort([5, 4, 1, 2, 3])
* [1, 2, 3, 4, 5]
* > bubbleSort([])
* []
* > bubbleSort([1, 2, 3])
* [1, 2, 3]
*
* > alternativeBubbleSort([5, 4, 1, 2, 3])
* [1, 2, 3, 4, 5]
* > alternativeBubbleSort([])
* []
* > alternativeBubbleSort([1, 2, 3])
* [1, 2, 3]
*/
/*
* Using 2 for loops
*/
function bubbleSort (items) {
const length = items.length
for (let i = (length - 1); i > 0; i--) {
// Number of passes
for (let j = (length - i); j > 0; j--) {
// Compare the adjacent positions
if (items[j] < items[j - 1]) {
// Swap the numbers
[items[j], items[j - 1]] = [items[j - 1], items[j]]
}
}
}
return items
}
/*
* Implementation of 2 for loops method
*/
const array1 = [5, 6, 7, 8, 1, 2, 12, 14]
// Before Sort
console.log('\n- Before Sort | Implementation using 2 for loops -')
console.log(array1)
// After Sort
console.log('- After Sort | Implementation using 2 for loops -')
console.log(bubbleSort(array1))
console.log('\n')
/*
* Using a while loop and a for loop
*/
function alternativeBubbleSort (arr) {
let swapped = true
while (swapped) {
swapped = false
for (let i = 0; i < arr.length - 1; i++) {
if (arr[i] > arr[i + 1]) {
[arr[i], arr[i + 1]] = [arr[i + 1], arr[i]]
swapped = true
}
}
}
return arr
}
/*
* Implementation of a while loop and a for loop method
*/
const array2 = [5, 6, 7, 8, 1, 2, 12, 14]
// Before Sort
console.log('\n- Before Sort | Implementation using a while loop and a for loop -')
console.log(array2)
// After Sort
console.log('- After Sort | Implementation using a while loop and a for loop -')
console.log(alternativeBubbleSort(array2))
console.log('\n')