Difference between revisions of "TADM2E 2.11"

Revision as of 18:22, 11 September 2014

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) $$ .

@@ Line 1: / Line 1: @@
 because
-&lt;math&gt; n^2 &lt;= 2^n &lt;/math&gt; for every n greater than 4 .
+<math> n^2 <= 2^n </math> for every n greater than 4 .
-Hence, we can say that &lt;math&gt; n^2 &lt; = C* 2^n &lt;/math&gt; for every n&gt;=4 and so &lt;math&gt; n^2 = O(2^n)&lt;/math&gt;.
+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]] ...