Bubble Sort

Compares adjacent elements and swaps them if out of order, bubbling the largest to the end each pass.

0 elements

SpdSize50

>Ready — Bubble Sort

Code

for (let i = 0; i < length; i++) {
  for (let j = 0; j < length - i - 1; j++) {
    if (compare(j, j + 1)) {
      swap(j, j + 1);
    }
  }
}

for (let i = 0; i < length; i++) {
  for (let j = 0; j < length - i - 1; j++) {
    if (compare(j, j + 1)) {
      swap(j, j + 1);
    }
  }
}

Analysis

BEST O(n)

AVG O(n²)

WORST O(n²)

SPACE O(1)

STABLE

Bubble Sort walks through the array comparing each pair of adjacent elements, swapping them if they’re in the wrong order. After each pass the largest unsorted element “bubbles” to its final position. Passes repeat until no swaps are needed.

Edit in playground→