Loading the lesson
Loading the lesson
Search AllRounder.ai
Search the courses, subjects, tracks, games and features, or jump straight to a page.
Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
What is the base case in the Fibonacci sequence?
Think about the starting points of the Fibonacci sequence.
How do you call the function to find F(3) in the Fibonacci series?
Start from the number you want to find.
What does F(0) equal in the Fibonacci series?
Consider the initial condition of the series.
The base case prevents ...?
Think about why we need a condition to stop recursion.
Implement a recursive method to calculate the n-th triangular number, where Triangular(n) = n + Triangular(n-1) with Triangular(0) = 0.
Consider the definition of triangular numbers.
Using recursion, generate a list of the first n Fibonacci numbers. Describe your approach.
Think about how you will store and return results with each recursive call.
5 more questions in this section. Enroll free to practise them all.
Enroll free