HOW TO LEARN RECURSION:
The COMBINING method
1. TREE1
2. TREE2
3. TREE3
4. TREE4
5. TREE
HOW TO DO RECURSION ONCE YOU'VE LEARNED:
The LEAP OF FAITH method
1. Find the *smaller similar subproblem*.
2. What should the result be from the smaller similar subproblem?
3. Assume you have that result. How do you create the big result?
4. Now write the procedure *assuming the recursive call works*.
5. Finally, worry about the base case(s).