SCHOOL OF CODE BUILDERS
Learn To CODE. Become A DEVELOPER.
Pages
HOME
DATA STRUCTURES
STRINGS
ARRAYS
MATRIX
BINARY TREES
LINKED LIST
STACK
QUEUE
SORTING
SEARCHING
C
PYTHON
PSEUDOCODE
CONTEST PROBLEMS
ALGORITHMS
PATTERNS
PHP
C PUZZLES
C INTERVIEW QUESTIONS
JAVA
C++
HASHING
RECURSION
BASIC C PROGRAMS
TCS-CODEVITA
FACEBOOK
CONTACT US
To return Nth Fibonacci Number
To return Nth Fibonacci Number
int FindFibo(int N): Read an Integer N # If N=0, return 0 If N=1, return 1 # As, Fib(0) = 0 & Fib(1) = 1 If N <= 1 : Return N ''' If we are here, Recur for (N-1) & (N-2) th Fibonacci Numbers, As Fibonacci numbers are sum of previous two numbers''' Return FindFibo( N - 1 ) + FindFibo( N - 2 )
PREVIOUS
NEXT
HOME