Problem Set 1 Solutions - MIT OpenCourseWare

log. 4 (5)) = Θ(n. lg √ 5), Case 1 of the Master Theorem. (d) T (n) = 25T (n/5) + n. 2. Solution: T (n) = Θ(n. 2. lg(n)). Case 2 of the Master Theorem. ... In the base case where v is a leaf node, the algorithm outputs the optimal placement ... Suppose that the map is divided into a square grid, where each square has dimensions ... ................
................

In order to avoid copyright disputes, this page is only a partial summary.