Bubble Sort Visualization
Speed:
Step: 0 / -1Algorithm Code
1function bubbleSort(arr) {
2 let swapped;
3 let n = arr.length;
4
5 do {
6 swapped = false;
7
8 for (let i = 0; i < n - 1; i++) {
9 // Compare adjacent elements
10 if (arr[i] > arr[i + 1]) {
11 // Swap elements
12 [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]];
13 swapped = true;
14 }
15 }
16
17 // One element is placed at the end
18 n--;
19 } while (swapped);
20
21 return arr;
22 }Visualization