Big Omega

$\Omega(f(n))$ — an asymptotic lower bound: the algorithm takes at least this long (for large $n$).

Intermediate

Any comparison sort is $\Omega(n \log n)$ in the worst case.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)