Bubble Sort

Sorting

avgO(n²)worstO(n²)spaceO(1)

Start with 24 unsorted values

1 / 462

Code

function bubbleSort(a: number[]) {  for (let i = 0; i < a.length - 1; i++) {    let swapped = false;    for (let j = 0; j < a.length - i - 1; j++) {      if (a[j] > a[j + 1]) {        [a[j], a[j + 1]] = [a[j + 1], a[j]];        swapped = true;      }    }    if (!swapped) break;  }  return a;}

procedure bubbleSort(A)  for i ← 0 to n − 2 do    swapped ← false    for j ← 0 to n − i − 2 do      if A[j] > A[j + 1] then        swap A[j] and A[j + 1]        swapped ← true      end if    end for    if not swapped then stop  end for  return Aend procedure

Variables

n=24

Counters

comparisons: 0
swaps: 0

Size24

Distribution

Custom values2 to 150 whole numbers, each 1 to 999

seed 7

How it works

Repeatedly steps through the list, compares adjacent pairs and swaps them if they are out of order. Each pass bubbles the largest remaining element to the end, and a pass with no swaps means the list is sorted.

Complexity

Best: O(n)
Average: O(n²)
Worst: O(n²)
Space: O(1)
Stable: Yes
In place: Yes

Bubble Sort

How it works

Complexity

Search algorithms