Difference between revisions of "TADM2E 2.11"
From Algorithm Wiki
(Blanked the page) |
|||
| Line 1: | Line 1: | ||
| + | because | ||
| + | <math> n^2 <= 2^n </math> for every n greater than 4 . | ||
| + | Hence, we can say that <math> n^2 < = C* 2^n </math> for every n>=4 and so <math> n^2 = O(2^n)</math>. | ||
| + | |||
| + | Return to [[Algo-analysis-TADM2E]] ... | ||
Revision as of 14:41, 23 July 2020
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 ...
