Home Work Number 4 Fall 2009

This is Home Work Number 4 - Questions on Divide and Conquer and Graphs - Due on 10/1/2009

Do the following five problems.
  1. Question 2.13 a, b (DG)
  2. Question 2.17 (DG)
  3. Exercise 4.1-6 of CLRS
  4. Question 3.1 (DG)
  5. Question 3.6 a, b (DG)
  6. (Optional)Describe an algorithm (using divide and conquer) to find the closest points from a given set of n points in a plane. (Hint: You may want to look at wikipedia article - Please do not submit the answer to this problem - Just for your enjoyment..