i want explaination about the program and its stack reprasetaion
fibbo(int n)
{
if(n==1 or n==0)
return n;
else
return fibbo(n-1)+fibbo(n-2);
}
main()
{
fibbo(6);
}
Answers were Sorted based on User's Feedback
Answer / abdur rab
#include <stdio.h>
int fibonacci ( int nNumber )
{
if ( ( nNumber == 0 ) || ( nNumber == 1 ) ) return
( nNumber );
return fibonacci ( nNumber -1 ) + fibonacci (
nNumber - 2 ) ;
}
int main ( int argc, char* argv[] )
{
printf ( "\n The Fibnoci value :%d", fibonacci (
5 ) );
return ( 1 );
Other than the logical or, everyting is perfect, the
function will recursivel bubble down and for this value it
ud become like this if u copy this to a notepad, with
formating, it ud be easy to understand
4 +
3
3 + 2
2 + 1
2 + 1 1 + 0
1 + 0 ( will return 1 )
1 + 0 ( all others will return 1 )
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / vignesh1988i
here the return function will give an error message or it
will only take the first function (ie) fibbo(n-1) since
after return this is the first recursive function
called.... so this altast return 1 to the main program....
that's all.... as for as i know this will be the
procedure...... and then the "or" must not be used .. only
logicalOR must be used ||.........
| Is This Answer Correct ? | 0 Yes | 1 No |
Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it's a simple test.]
What is the restrict keyword in C?
Explain the use of keyword 'register' with respect to variables.
What is nested structure in c?
What is an auto keyword in c?
Does c have an equivalent to pascals with statement?
write a program to gat the digt sum of a number (et. 15= >1+5=6)
implement NAND gate logic in C code without using any bitwise operatior.
Hierarchy decides which operator a) is most important b) is used first c) is fastest d) operates on largest numbers
What is pointer to pointer in c?
How can you increase the allowable number of simultaneously open files?
is c language is a object oreinted language?