What is the time complexity of bubble sort?

Best case O(n). Average case O(n²). Worst case O(n²). Space complexity is O(1). n passes over up to n elements; the early exit gives the linear best case.

Bubble sort

easy

Each pass carries the largest remaining value to the right. Simple, stable, and slow - but the early-exit check turns the best case into a single linear pass, which is worth understanding before dismissing it.

Best O(n)Average O(n²)Worst O(n²)Space O(1)StableIn place

Loading the bubble sort engine…

Where to go next

Insertion sort

easy

How you sort a hand of cards.

Selection sort

easy

Find the minimum, move it to the front, repeat.

Quick sort

medium

Partition around a pivot, then recurse on both halves.