Algorithms Homework – Fall 2000

4.1-3 Show that by making a different inductive hypothesis, we can overcome the difficulty with the boundary condition T( 1 ) = 1 for the recurrence (4.4) without adjusting the boundary condition for the inductive proof. See pp 55 - 57. 4.1-4 Show that ((n lg n) is the … ................
................