OJ Board

I have the same problem... the definition i have for θ(n) (or average complexity order) is:

f = θ(g) or f ∈ θ(g) if f grows (eventually) at the same rate as g, and:
θ(g) = {f | ∃N, K1, K2 > 0, such that, if n >= N then K1*g(n) <= f(n) <= K2*g(n)}