Nth Fibonacci Series
Sun Feb 06 2022 21:03:20 GMT+0000 (Coordinated Universal Time)
Saved by @Uttam #java #gfg #geeksforgeeks #lecture #recursion #fibonacci #n-thfibonacci #fibonacciseries
Program for Fibonacci numbers The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …….. In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation : Fn = Fn-1 + Fn-2 with seed values : F0 = 0 and F1 = 1. Given a number n, print n-th Fibonacci Number. Examples: Input : n = 2 Output : 1 Input : n = 9 Output : 34
https://practice.geeksforgeeks.org/problems/fibonacci-using-recursion/1/?track=DSASP-Recursion&batchId=190
Comments