01:198:344 Lecture Notes - Lecture 3: Merge Sort

83 views1 pages

Document Summary

Divide both sides by 2n, put g(n) = t (n)/2n and we get g(n) = g(n 1)+1 which solves to g(n) = o(n). T (n) = 2t (n 1) + 2n: solving recurrence: Divide both sides by n, and put g(n) = t (n)/n. We get g(n) = g(n/2) + 1 which solves to g(n) = O(log n) and thus, t (n) = o(n log n): solving recurrence: T (n) = t (n/3) + t (n/5) + n. Replace by t (n) 2t (n/3)+n since t (n/5 t (n/3). We can not just plug in t (n) = o(n2) but have to expand out as say t (n) = cn2 + d or. T (n) = cn2 + dn + e. more in the next lecture: before next lecture, read master theorem from the textbook, you don"t have to read the proof.

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