Big-Theta term
tight bound — exact asymptotic growth
f(n) is Θ(g) if it grows exactly like g, both upper and lower. Most precise complexity claim. People often say 'O(n)' when they mean 'Θ(n).'
tight bound — exact asymptotic growth
f(n) is Θ(g) if it grows exactly like g, both upper and lower. Most precise complexity claim. People often say 'O(n)' when they mean 'Θ(n).'