CS 4349: Algorithms
Spring 2008
Assignment 1

Due: Wednesday, January 16 (in class)

1. Consider the Merge procedure in page 29.  Analyze its running time
   using the style in page 24 (analysis of insertion sort), and finally
   write it in asymptotic notation (i.e., O(?)).

2. Exercise 4.3-2 (page 75)  [Ed. 1: Ex. 4.3-2, p. 64].

3. Solve the recurrences in Problem 4-1 (page 85) using the master method,
   if it applies.  If the master method does not apply, solve it using
   one of the other methods discussed in class.  [Ed 1: Prob 4-1, p. 72].