TADM2E 2.11

From Algorithm Wiki
Revision as of 00:55, 1 August 2020 by Matt (talk | contribs) (Undo revision 1072 by FuckMatt (talk))
(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 ...