Bubble Sort

Repeatedly compares adjacent pairs and swaps them if out of order. After each full pass the largest remaining element 'bubbles' to the end.

time O(n²)

space O(1)

Input

Press Tab out of the box or click Resetto regenerate frames from the current input.

Visualization

No frames yet — edit input and click Run.

—

Pseudocode

for i in 0..n-1:
  for j in 0..n-i-1:
    if a[j] > a[j+1]:
      swap(a[j], a[j+1])