SortingSorting

Bubble Sort

Repeatedly swap adjacent out-of-order pairs so the largest remaining element bubbles to the end each pass.

Array — Comma or space separated numbers, up to 40

1/54Start with 8 unsorted elements. Each pass bubbles the largest remaining element to the end.

ComparingSwappedIn final position

1for i in 0 .. n-1:
2  swapped = false
3  for j in 0 .. n-i-2:
4    if a[j] > a[j+1]:
5      swap(a[j], a[j+1])
6      swapped = true
7  if not swapped: break

Complexity

best O(n)

avg O(n²)

worst O(n²)

space O(1)

Speed