Computer Science 789 Online Algorithms

Hint 2 for the Pascal Recursion Problem

Prove that the number of recursive calls is not more than 2 lg(n).

Use strong induction.

Back to Course Page

Back to Assignment Page

Back to Assignment 1