Prove that the number of recursive calls is not more than 2 lg(n), where we write lg(x) to denote the base 2 logarithm of any positive number x.
Back to Assignment Page
Back to Assignment 1