2.13

From The Algorithm Design Manual Solution Wiki
Revision as of 19:39, 10 September 2020 by Algowikiadmin (talk | contribs) (Created page with "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>. Back t...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

because [math]\displaystyle{ n^2 \lt = 2^n }[/math] for every n greater than 4 . Hence, we can say that [math]\displaystyle{ n^2 \lt = C* 2^n }[/math] for every n>=4 and so [math]\displaystyle{ n^2 = O(2^n) }[/math].


Back to Chapter 2