By the end of this module, you should:
- know how to describe the running time of a recursive program with a
recurrence
- be able to use substitution to confirm a closed-form solution to a
recurrence
- know how binary search works
- be able to sketch recursion trees and use them to solve a recurrence
- be prepared for the first exam