Difference between revisions of "TADM2E 2.11"
From Algorithm Wiki
(Recovering wiki) |
|||
| (4 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
because | because | ||
| − | + | <math> n^2 <= 2^n </math> for every n greater than 4 . | |
| − | Hence, we can say that | + | 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]] ... | Return to [[Algo-analysis-TADM2E]] ... | ||
Latest revision as of 00:55, 1 August 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 ...
