Skip to content
UPEEC

Big Theta

$\Theta(f(n))$ — a tight bound: both $O(f)$ and $\Omega(f)$.

Intermediate
Comments 0

Merge sort is Θ(nlog⁡n)\Theta(n \log n) in every 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)

Sign in or join free to ask questions and discuss this topic.