Homework 2, ENEE641, Fall 2005

Due: September 27, in class.

Second edition:

Problem 4-1, page 85.

Use the version of the master theorem   
stated in Exercise 4.4-2 to solve the
recurrence T(n) = 2 T(n/2) + n log n.
(You need not prove Exercise 4.4-2.)

Do Problem 7-4 on page 162.