CS151 Functional Programming

The first lecture on Functional Programming.
Corrections:
1) At time 25:15 I said that the function was tail-recursive because the recursive step was at the end of the function definition. I meant to say that the recursive step is the last statement executed.
2) At time 26:59 I use different base cases in the outline and in the implementation. In the outline, the base case is comparing letters in a string of length 2. In the implementation, the base case is a string of length 1. Compare this to the two base cases we had in the integer multiplication (rec_mult) example where the first multiplied two integers and the second just returned a single integer.