Dynamic Programming Approach
We prevent unnecessary calculations by storing previously computed Fibonacci numbers in an array, which increases algorithmic performance.
Example: This example shows the Iterative approach to finding the nth term.
Javascript
function fibonacciDynamic(n) { let fib = [0, 1]; for (let i = 2; i <= n; i++) { fib[i] = fib[i - 1] + fib[i - 2]; } return fib[n];}const n = 2;console.log(`The ${n}-th Fibonacci number is: ${fibonacciDynamic(n)}`); |
Output
The 2-th Fibonacci number is: 1
JavaScript Program to Find n-th Fibonacci Number
The Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1. The sequence goes as follows: 0, 1, 1, 2, 3, 5, 8, 13, 21, and so on. Given an integer n, the task is to find the n-th Fibonacci number.
These are the following methods:
Table of Content
- Recursive Approach
- Iterative Approach
- Dynamic Programming Approach