COMS W3134 Chapter Notes - Chapter 2: Martina Stoessel, Subsequence
18 Dec 2020
School
Department
Course
Professor
Document Summary
Tin ) grows at a rate no faster than fini. Tini is a lower bound on f- ( n ) Tini = o ( pl n ) ) I chapter 2 algorithm analysis f- in ) = 0cg in ) ) Example : grows faster than nz grows slower than n " : grow at the same rate f- in ) =d ( g ( n1 ) can be fl n ) = f ( g in ) ) I depends on context ) g ini = o ( n " ) g ( n ) = of n3 ) g ( n ) = oliva ) (cid:15482) gin 1=0 in "t. If tini polynomial of degree k (cid:15482) tini = o ( n " ) ( i. e . N = 01n ) for any constant k logs grow very slowly relative growth rate of f- ( n ) and g ini : whiffs fg.
