CS 314: Algorithms
Homework 1: Due 1/26
1. (20 points) Solve the following recurrences. Your answers should be in the form (f (n) for some
function f (n). You do not need to turn in proofs; however, you should show your work.
(a) A(n) = 2A(n/3) + lg n