# TADM2E 2.11

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

because $n^2 <= 2^n$ for every n greater than 4 . Hence, we can say that $n^2 < = C* 2^n$ for every n>=4 and so $n^2 = O(2^n)$.

Return to Algo-analysis-TADM2E ...