CS 404-31 - Analysis of Algorithms
Final Exam
December 3, 2003
1. Use Binary Search Recursion to search for the integer 26 in the following list of integers.
Show the actions step by step.
15 26 39 41 44 50 55 60
2. Suppose that there are n= 2kteams in an elimination tournament, in which there are
n/2 games in the first round, with the n/2 = 2k−1winners playing in the second round
and so on.
(a) Develop a recurrence equation for the number of rounds in the tournament
(b) How many rounds are there in the tournament when there are 256 teams?
(c) Solve the recurrence equation of part (a).
