1. Take the Fractal example from the textbook and place cout statements throughout the code (using appropriate setw) to show the different levels of recursion. What happens where... etc.

Write a document that explains the process of recursion in simple terms.

A CS student who is not familiar with recursion, must be able to learn recursion by reading your document.

2. Do the same with the binary search algorithm.