Sorting Visualizer

Default

Comparing

Swapping

Pivot

Sorted

Debugger · v1.0

LIVE

1function bubbleSort(array) {

2 const n = array.length;

3 for (let i = 0; i < n - 1; i++) {

4 for (let j = 0; j < n - i - 1; j++) {

5 if (array[j] > array[j + 1]) {

6 swap(array, j, j + 1);

7 }

8 }

9 }

10}

Debugger · v1.0

LIVE

1function bubbleSort(array) {

2 const n = array.length;

3 for (let i = 0; i < n - 1; i++) {

4 for (let j = 0; j < n - i - 1; j++) {

5 if (array[j] > array[j + 1]) {

6 swap(array, j, j + 1);

7 }

8 }

9 }

10}

State Inspector

?

No variables in scope.

Size:30

1x

Sorting Visualizer

Bubble Sort

Step 1 of 6

Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

Compare Adjacent

Compare the first two elements. If the first is greater than the second, swap them.