Computer Science 789 Online Algorithms

Hint 1 for the Pascal Recursion Problem

O(log n) is too vague. You must make it precise in order to prove the result.

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 Course Page

Back to Assignment Page

Back to Assignment 1