Little o Notation in data structure
This notation provides a non-asymptotically tight upper bound for f(n). To express a function using this notation, we write f(n) ∈ o(g(n)) where o(g(n)) = {h(n) : ∃ positive constants c, n0 such that for any c > 0, n0 > 0, and 0 ≤ h(n) ≤ cg(n), ∀ n ≥ n0 }. This is … Read more