Discrete Mathematics for Computer Science - Spring 2005
Homework 5

Prove by induction that the recursive binary search algorithm on page 277 runs in O(log2n) time.

Pages 253-256
34,44,60

Page 293
40