CS 263 - Algorithms Homework 3, 50 Points
Due: Monday, October 26, 2009

  1. 10 points. Problem 1 from Chapter 5 of K-T.
  2. 10 points. Problem 2 from Chapter 5 of K-T.
  3. 10 points. Problem 5 from Chapter 5 of K-T.
  4. 10 points. Design a divide-and-conquer algorithm for finding the minimum and the maximum element of n numbers using no more than 3n/2 comparisons.
  5. 10 points. Given a set P of n teams in some sport, a round-robin tournament is a collection of games in which each team plays each other team exactly once. Design an efficient algorithm for constructing a round-robin tournament that runs for n-1 days (so each day has each team playing another team), assuming n is a power of 2.