Little Omega Notation (w) in data structure
This notation provides a non-asymptotically tight lower bound for f(n). It can be simply written as, f(n) ∈ ω(g(n)), where ω(g(n)) = {h(n) : ∃ positive constants c, n0 such that for any c > 0, n0 > 0, and 0 ≤ cg(n) < h(n),∀ n ≥ n0 }. This is unlike the Ω notation … Read more