Recursive Functions
Explore how recursive functions operate in JavaScript by learning to create functions that call themselves. Understand the base case and recursive case through algorithmic problems like the Fibonacci sequence. This lesson helps develop problem-solving skills using recursion and prepares you for advanced JavaScript concepts.
A number of algorithmic problems can be solved with recursion when a function calls itself by name.
What is recursion?
Recursion is a method of function calling in which a function calls itself during execution.
There are problems that are naturally recursively defined. For example, the Fibonacci sequence is defined in a recursive way. By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two.
fibonacci(n) = fibonacci(n-2) + fibonacci(n-1)