Write a Fibonacci function then takes an input from the user in main program and pass to function which prints Fibonacci series up to this number using function in c plus plus language?

Answer 1

We use long int or long instead of int as for larger terms the number is also larger.

Code is as follows:

#include

#include

long fib(long n);

void main()

{

long res,n;

int i;

printf("Enter the number of terms of the Fibonacci Series:\t");

scanf("%d",&n);

for(i=0;i

{

res=fib(i);

printf("\n %d",res);

}

_getch();

}

long fib(long n)

{

long res;

if(n==0n==1)

return (n);

else

res=fib(n-1)+fib(n-2);

return(res);

}

Answer 2

//This program will generate the Fibonacci numbers using recursion till a particular limit

#include<stdio.h>

int fib(int);

void main()

{ int limit;

printf("Enter the limit");

scanf("%d",&limit);

for(int i=0;fib(i)<=limit;i++)

printf("\n%d",fib(i));

}

int fib(int a)

{

if(a==0a==1)

return 1;

else

return (fib(a-1)+fib(a-2));

}

Answer 3

//program to find the fibonnacci series of n numbers.

#include <stdio.h>

void fibo(int);

void main()

{

int iLimit;

printf("Enter the number till which the fibonnacci series should be printed.");

scanf("%d",&iLimit);

fibo(iLimit);

}

void fibo(int iLimitnum)

{

int inum1,inum2,inum3;

int iadd;

inum1=0;

inum2=1;

int i;

printf("0 ");

for (i=0; ;i++)

{

iadd=inum1+inum2;

inum1=inum2;

inum2=iadd;

if(inum1 > iLimitnum)

break;

printf("%d ", inum1);

}

}

Answer 4

#include<stdio.h>

#include<conio.h>

void main()

{

int n,c,a=0,b=1;

clrscr();

printf("Enter the number to generate febonacci series:");

scanf("%d",&n);

for(i=0;i<n;i++)

{

c=a+b;

printf("%d",c);

}

a=b;

b=c;

getch();

}

Answer 5

#include<stdio.h>

#include<conio.h>

void main()

{

int n,f1,f2,f3;

clrscr();

printf("\n\n\t\tFIBONACCI SERIES\n");

printf("\nenter the number of terms required\n");

scanf("%d",&n);

printf("\nThe Fibonacci series is:\n");

f1=1;

f2=0;

for(i=1;i<=n;i++)

{

f3=f1+f2;

printf("\n%d",f3);

f1=f2;

f2=f3;

}

getch();

}

Answer 6

Before you think about writing the code, write out the algorithm, what steps you need to do to get your result. You need to ask yourself what you do to find the next number in the series.

You'll need a global variable for each of the last two numbers (lets say X and Y), a temporary variable (int), some loops (and an index variable), and how many numbers in the series you want to be calculated and displayed.

If you want to use it as a function, you just put the code in a separate area to the main, and make it return a value.

Here are the basic steps for the Fibonacci function:

1. Y = Temporary (for later)
2. Work out the next number, Y = X + Y
3. X = Temporary (basically, the old Y is the new X)
4. return Y (the new number)

You can also work this out with arrays, which is probably a better solution, but needs more code to work out the laast two numbers in the array.

Answer 7

I am not so sure about C++, but Python is somewhat similar.

def awesome_function()

number = input("The number you would like to use?")

for i in range(number)

print(i)

Great question! ^^

Answer 8

You cannot produce a Fibonacci sequence with a single number. Each number in the sequence is the sum of the previous two numbers, which traditionally begins with the numbers 0 and 1. Entering a single number n usually means you're looking for the nth number in the sequence.

Regardless, recursion is not the most efficient way of producing the Fibonacci sequence. Although the code may be cleaner, every recursion consumes more call stack space for no good reason, and ultimately slows down the generation of the sequence.

Iteration is the method of choice here. Although it requires a few more lines of code, this is more than offset by the speed of execution.

#include

using namespace std;

int Fib(

unsigned int n,

const unsigned int penultimate,

const unsigned int ultimate )

{

return( n ? Fib( --n, ultimate, penultimate + ultimate ) : ultimate );

}

int main()

{

unsigned int in = 1;

while( in )

{

printf( "Enter the Fibonacci number you're looking for (1-48): " );

if( scanf( "%u", &in ) 3 ? "rd" : "th",

fib );

}

}

}

return( 0 );

}

Answer 9

no...i want complete c code using stack