The Fibonacci sequence is a common example for recursion. The formula used to define this sequence is called a recursive formula. If a sequence is defined so that it depends on the value of the previous term, then to find the kth term, you must first compute terms 2, 3, 4, , and k 1. You will be given the first term. Another thing you'll learn about in this lecture is the iteration. Iteration is the process of composing a function with itself again and again and can be used to generate a sequence recursively. You'll see how in the examples.
*These practice questions are only helpful when you work on them offline on a piece of paper and then use the solution steps function to check your answer.
Recursion and Special Sequences
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.