Bubble Sort

sorting

Click Generate New or press Play

Step 1 / 1

Ready

Speed

Repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

Time Complexity

Best

\mathrm{O}\left(n\right)

Avg

\mathrm{O}\left(n^{2}\right)

Worst

\mathrm{O}\left(n^{2}\right)

Max Operations

Worst-case bound

\frac{n(n-1)}{2}

Used for efficiency calculation in Stats Panel

Space Complexity

Aux

\mathrm{O}\left(1\right)

In-place — only a temp swap variable

Pseudocode

1procedure bubbleSort(A: list)

2for i = 0 to n-1 do

3swapped = false

4for j = 0 to n-i-2 do

5if A[j] > A[j+1] then

6swap(A[j], A[j+1])

7swapped = true

8if not swapped then break

9end for