Difference between revisions of "TADM2E 2.11"

From Algorithm Wiki
Jump to: navigation, search
(Recovering wiki)
(Undo revision 1072 by FuckMatt (talk))
 
(3 intermediate revisions by 3 users not shown)
(No difference)

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