tag:blogger.com,1999:blog-959939550345671470.post9208254057420599394..comments2024-03-24T12:51:18.535+05:30Comments on C programming Interview questions and answers: C program for Fibonacci series using recursionPriyanka kumarihttp://www.blogger.com/profile/08145649011863585828noreply@blogger.comBlogger25125tag:blogger.com,1999:blog-959939550345671470.post-29138013455641623532017-03-09T18:16:38.127+05:302017-03-09T18:16:38.127+05:30int fibo(int n)
{
if(n<=1)
return n;
el...int fibo(int n)<br />{<br /> if(n<=1)<br /> return n;<br /> else<br /> return (fibo(n-1)+fibo(n-2));<br />}<br />main()<br />{<br /> n=6;<br /> for(i=0;i<n;i++)<br /> printf("%d",fibo(i));<br />}Jeniferhttps://www.blogger.com/profile/07933436489854253319noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-14306917307829768552016-04-25T22:38:23.326+05:302016-04-25T22:38:23.326+05:30I don't like to print 0 and 1 manually....so t...I don't like to print 0 and 1 manually....so try this...<br />void printFibonacci(int n){<br /><br /> static long int first=-1,second=1,sum;<br /><br /> if(n>0){<br /> sum = first + second;<br /> first = second;<br /> second = sum;<br /> printf("%ld ",sum);<br /> printFibonacci(n-1);<br /> }<br /><br />}Anonymoushttps://www.blogger.com/profile/10720090042757342266noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-79348592439049824042016-04-22T06:21:57.288+05:302016-04-22T06:21:57.288+05:30the declaration of variables first,second and sum ...the declaration of variables first,second and sum should be made global to get correct outputAnonymoushttps://www.blogger.com/profile/04587191691476760464noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-83483821257102356212016-04-11T21:00:36.482+05:302016-04-11T21:00:36.482+05:30write a program 1 2 2 4 8 32 series like that disp...write a program 1 2 2 4 8 32 series like that displayAnonymoushttps://www.blogger.com/profile/15520591655904978848noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-5014071779495512592016-03-25T09:37:35.803+05:302016-03-25T09:37:35.803+05:30what is program & why using programwhat is program & why using program sankethttps://www.blogger.com/profile/12966986463522408541noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-49064155196442765692016-01-24T10:13:41.816+05:302016-01-24T10:13:41.816+05:30what is the meaning of long int or static long in ...what is the meaning of long int or static long in recursion program<br />Social Issuehttps://www.blogger.com/profile/09458296033346094539noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-34260876001683962312015-12-04T01:25:37.598+05:302015-12-04T01:25:37.598+05:30#include
void main()
{
int i,n;
int fab(int);
...#include<br /><br />void main()<br />{<br /> int i,n;<br /> int fab(int);<br /> <br /> printf("Enter numbers of terms of Fabonnacci series :");<br /> scanf("%d",&n);<br /> for(i=1;i<=n;i++)<br /> {<br /> printf("%d, ",fab(i));<br /> }<br /> printf("\n"); <br /> <br />}<br /><br />int fab(int n)<br />{<br /> if(n-2<=0)<br /> return(1);<br /> hb74https://www.blogger.com/profile/16063308826534576043noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-67684158363155993162015-11-29T23:07:05.454+05:302015-11-29T23:07:05.454+05:30#include
int fib(int n)
{
if (n==1)
...#include <br /><br />int fib(int n)<br />{<br /> if (n==1)<br /> return 1;<br /> else if (n==0)<br /> return 0;<br /> else<br /> return (fib(n-1)+fib(n-2));<br />}<br /><br />int main()<br />{<br /> int number,i=0;<br /> printf("Enter Number for fib series : ");<br /> scanf("%d",&number);<br /> while(i<number)<br /> {<br /> printf(&Noman Ibne Mimdad Turzohttps://www.blogger.com/profile/15828892973114547248noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-53210145391698593342015-10-20T23:30:13.662+05:302015-10-20T23:30:13.662+05:30This comment has been removed by the author.Touhidhttps://www.blogger.com/profile/07586313409608678568noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-547791655329225452015-09-06T14:24:54.598+05:302015-09-06T14:24:54.598+05:30no the logic seems to work perfectlyno the logic seems to work perfectlyAnonymoushttps://www.blogger.com/profile/10845466886277588940noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-81544374111668430792015-08-03T22:18:57.713+05:302015-08-03T22:18:57.713+05:30#include
void printFibonacci(int);
int main(){
...#include<br /><br />void printFibonacci(int);<br /><br />int main(){<br /><br /> int k,n;<br /> long int i=0,j=1,f;<br /><br /> printf("Enter the range of the Fibonacci series: ");<br /> scanf("%d",&n);<br /><br /> printf("Fibonacci Series: ");<br /> <br /> printFibonacci(n);<br /><br /> return 0;<br />}<br /><br />void printFibonacci(int nAnonymoushttps://www.blogger.com/profile/02840924200704844241noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-22975385010205470762015-08-03T22:18:33.515+05:302015-08-03T22:18:33.515+05:30#include
void printFibonacci(int);
int main(){
...#include<br /><br />void printFibonacci(int);<br /><br />int main(){<br /><br /> int k,n;<br /> long int i=0,j=1,f;<br /><br /> printf("Enter the range of the Fibonacci series: ");<br /> scanf("%d",&n);<br /><br /> printf("Fibonacci Series: ");<br /> <br /> printFibonacci(n);<br /><br /> return 0;<br />}<br /><br />void printFibonacci(int nAnonymoushttps://www.blogger.com/profile/02840924200704844241noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-24140446314623068612015-07-02T01:49:13.534+05:302015-07-02T01:49:13.534+05:30This comment has been removed by the author.Anonymoushttps://www.blogger.com/profile/14863789011547005445noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-58119262202502348922015-06-09T03:23:32.434+05:302015-06-09T03:23:32.434+05:30thankssssssthankssssssAnonymoushttps://www.blogger.com/profile/06781943258206941956noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-23602833835579710062015-05-22T13:08:34.755+05:302015-05-22T13:08:34.755+05:30Make it n-2 in for statementMake it n-2 in for statementAnonymoushttps://www.blogger.com/profile/18056072336433153103noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-75485256286868032402015-04-03T21:13:19.373+05:302015-04-03T21:13:19.373+05:30its not working
its not working<br />Anonymoushttps://www.blogger.com/profile/05866584501389195116noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-68204287214841634822015-03-13T00:16:50.655+05:302015-03-13T00:16:50.655+05:30There is a better solution for fibo recursive:
No...There is a better solution for fibo recursive:<br /><br />Notes:<br />Call it with n > 0 and 0, 1 as initial fibo elements.<br />Print a 0 before the call.<br /><br />The code:<br />void fibo_recursive(int n, int i, int j)<br />{<br /> if (n > 0)<br /> {<br /> printf("%d, ", j);<br /> int temp = j;<br /> j = j + i;<br /> i = temp;<br /> Ahmed Hamdyhttps://www.blogger.com/profile/10318214638388046912noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-85914477408848843692014-07-11T05:40:30.077+05:302014-07-11T05:40:30.077+05:30plz..
Check the logic is wrong plz..<br /> Check the logic is wrong Anonymoushttps://www.blogger.com/profile/06638676395018342456noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-38686363503372459322014-07-11T05:31:08.640+05:302014-07-11T05:31:08.640+05:30#include
void printFibonacci(int);
int main(){
...#include<br /><br />void printFibonacci(int);<br /><br />int main(){<br /><br /> int k,n;<br /> long int i=0,j=1,f;<br /><br /> printf("Enter the range of the Fibonacci series: ");<br /> scanf("%d",&n);<br /><br /> printf("Fibonacci Series: ");<br /> printf("%d %d ",0,1);<br /> printFibonacci(n);<br /><br /> return 0;<br />}<br /Anonymoushttps://www.blogger.com/profile/06638676395018342456noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-38065159462691217072013-09-19T18:51:56.512+05:302013-09-19T18:51:56.512+05:30This is really helpful.
For Dynamic Programming th...This is really helpful.<br />For <a href="http://crsriharsha.blogspot.in/2013/05/minimum-spanning-of-multistage-graph.html" rel="nofollow">Dynamic Programming</a> this seems 2 be d brief one...<br />Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-58113520336026507352013-06-09T17:23:28.051+05:302013-06-09T17:23:28.051+05:30How can I tell if a given source code has used rec...How can I tell if a given source code has used recursion or not, when there is a function declared?CProgrammerhttps://www.blogger.com/profile/01361046419925259770noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-86176959500286321982013-06-07T13:16:08.495+05:302013-06-07T13:16:08.495+05:30//in c++
//this is short code of Fibonacci functio...//in c++<br />//this is short code of Fibonacci function in recursion..<br /><br />int fib(int n){<br /><br />if(n==0){<br /> return 0;<br />}else if(n==1){<br /> return 1;<br />}else{<br /><br /> return fib(n-1)+fib(n-2);<br /> }<br />}<br /><br />Void main( )<br />{<br /><br />cout<<fib(n)<<endl;<br /><br />}<br />dlovan bashir alihttps://www.blogger.com/profile/17014918469611263523noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-75911796701059529472012-09-07T01:05:12.424+05:302012-09-07T01:05:12.424+05:30#include
#include
Void main( )
{
Int n, i, c, a ...#include<br />#include<br />Void main( )<br /> {<br /> Int n, i, c, a = 0, b = 1;<br /><br />printf(“Enter Fibonacci series of n’th term”);<br />scanf(“%d”, & n);<br />printf(“%d%d”, a, b);<br />for ( i = 0; I <= (n-3); i++)<br /> {<br /> c = a + b<br /> a = b<br /> b = c<br />printf(“%d”,c);<br /> }<br />getch( );<br />}<br /><br />Out put:<br />Enter the Fibonacci series of n’th term : CSE Answerhttp://cseanswers.blogspot.com/noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-11557885150665353252011-12-18T14:25:18.261+05:302011-12-18T14:25:18.261+05:30Find non fibonesis serize using functionFind non fibonesis serize using functionSURYAKANThttps://www.blogger.com/profile/07589577327601315962noreply@blogger.comtag:blogger.com,1999:blog-959939550345671470.post-22188741980390684282011-11-05T14:32:01.726+05:302011-11-05T14:32:01.726+05:30void main()
{
int a,b,c,i,n;
a=0;
b=1;
printf(&quo...void main()<br />{<br />int a,b,c,i,n;<br />a=0;<br />b=1;<br />printf("Enter number of terms of the series to be generated:");<br />scanf("%d",&n);<br />if(n==1)<br />{<br />printf("\n FIBONACCI SERIES\n");<br />printf("%d",a);<br /><br />}<br />else if(n==2)<br />{<br />printf("\n FIBONACCI SERIES\n");<br />printf("%d\t%d",a,b);<brakshay76https://www.blogger.com/profile/05101245883563564981noreply@blogger.com