THETA NOTATION (Q) in data structure
Theta notation provides an asymptotically tight bound for f(n). Θ notation is simply written as, f(n) ∈ Θ(g(n)), where n is the problem size and Θ(g(n)) = {h(n): ∃ positive constants c1 , c2 , and n0 such that 0 ≤ c1 g(n) ≤ h(n) ≤ c2 g(n), ∀ n ≥ n0 } Hence, we … Read more