Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,872 questions

51,796 answers

573 users

How to find the Nth fibonacci number using recursion in C

1 Answer

0 votes
#include <stdio.h>

int fibonacci_recursion(int n) {
    if (n == 0) {
        return 0;
    } 
    else { 
        if (n == 1) {
            return 1;
        }
        else {
            return(fibonacci_recursion(n - 1) + fibonacci_recursion(n - 2));
        }
    }
}    
int main() {
	int n = 8;        
	
	int result = fibonacci_recursion(n);

    printf("The %d number in fibonacci series = %d\n", n, result);

	return 0;

}

 
 
   
/*
run:
   
The 8 number in fibonacci series = 21
  
*/

 



answered Jan 15, 2021 by avibootz

Related questions

...