In this lesson, our instructor Tom Quayle goes through an introduction on algorithms: recursion. He starts by discussing recursion and explains caluclating factorials and fibonacci numbers. Then, he talks about other recursive functions and important cons
A recursive call must be made with a different value than the method itself was
A recursive method must contain a conditional statement that will eventually
cause it to exit without calling itself again
The case that causes the method to exit without calling itself again is called a
Calculating factorial numbers is a common recursive algorithm
Calculating Fibonacci numbers is a common recursive algorithm
Lecture Slides are screen-captured images of important points in the lecture. Students can download and print out these lecture slide images to do practice problems as well as take notes while watching the lecture.