COMS W3134 Lecture 2: Data Structures- Lecture 2

65 views3 pages

Document Summary

* we chose power of 2 * since we divide by 2 each time. C cost of algorithm : 01 1 in terms of n , given n = 2x : X = logan cost of algorithm : 0110g zh ) X is what power of two n is . When writing log , we usually assume its base 2 cost of algorithm : o ( log n ) 2 " t xn = 2x t 2n = z ntl. A , b , c > o , a * i. B if log b - log a b (cid:12200) l0gcb_ i. A logo a log at log bi a , b > 0 log ab = log ( a/b ) = log a - log b. "log ( ab ) = blog a for all log x c x. X s o log i = o , log 2=1 , log 1,024 =

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions