Write a program to find sum of Fibonacci series using function
Code:-
#include<stdio.h>
int fib(int n)
{
if(n==1||n==2)
return 1;
return (fib(n–1)+fib(n–2));
}
int main()
{
int n,i,sum=0;
printf(“Enter number of term in fibbo seriesn”);
scanf(“%d”,&n);
for(i=1;i<=n;i++)
{
sum=sum+fib(i);
}
printf(“Sum of the series is: %d”,sum);
return 0;
}
Output:-
Enter number of term in fibbo series
5
Sum of the sereis is: 12
Recommended Post:-
-
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
Key points:-
MCQs:-
