This shows you the differences between two versions of the page.

cs-312:hw22 [2014/12/31 16:06] ringger created |
cs-312:hw22 [2014/12/31 16:28] (current) ringger |
||
---|---|---|---|

Line 17: | Line 17: | ||

===Question 3=== | ===Question 3=== | ||

- | Divide and Conquer: Solve the recurrence relation: <math>T(n) = 7 T(\frac{n}{3}) + n</math>. Use the theorems for solving recurrence relations and NOT the Master Theorem. You may check your result with the Master Theorem. | + | Divide and Conquer: Solve the recurrence relation: $T(n) = 7 T(\frac{n}{3}) + n$. Use the theorems for solving recurrence relations and NOT the Master Theorem. You may check your result with the Master Theorem. |