DATA STRUCTURES • ALGORITHMS

Bubble Sort

A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

Time

O(N²) (Worst/Average Case)

Space

O(1) (In-place)

Key Principle 1

Repeated adjacent swaps

Key Principle 2

Stable sorting algorithm

Key Principle 3

Largest element 'bubbles' to end

Key Principle 4

Inefficient for large datasets

BUBBLE_SORT_LAB
ARRAY:
Current Step
Starting Bubble Sort. Heavy elements will 'bubble' to the end.
Playback
Pass Data ⠿
STATUSInit
PASSES0
Bubble Logic ⠿
1for (int i = 0; i < n-1; i++) {
2    for (int j = 0; j < n-i-1; j++) {
3        if (arr[j] > arr[j+1]) {
4            swap(arr[j], arr[j+1]);
5        }
6    }
7}
45
[0]
12
[1]
33
[2]
8
[3]
20
[4]

Loading Lab...