General Strategy
- Objective: prove that a procedure has property P for any
non-negative argument n
- Base Case: Show that the procedure has property P for
argument n = 0 (or perhaps n = 1).
- Inductive Step: Choose one of the following:
- Show that if the procedure has property P for n-1
then it does for n
- Show that if the procedure has property P for n
then it does for n+1
- Show that if the procedure has property P for k <
n then it does for n
Here is a short, instructive video
(opens in an external window).