Question

Fibonacci function Fib(n) is given below.

Fib(n)= Fib(n-1) + Fib(n-2) for n > 1

Fib(n)= 1 for n=1

Fib(n)= 0 for n=0

Using following initialization

unsigned int *Fib = new unsigned int[30];

and function prototypes

void push(int n)
unsigned int pop( )

insert first 30 Fibonacci numbers into dynamic array Fib and then pop them to print out first 30 numbers in descending order.
The output of your program should be
514229, 317811, 196418, ......, 1, 1, 0

Answer 1

Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

#include <iostream>
using namespace std;

class Fibo
{
public:
int ind=0;
unsigned int *Fib = new unsigned int[30];
void push(int n)
{
Fib[ind++]=n;
}
unsigned int pop( )
{
return Fib[--ind];
}
};

int main(){
Fibo f;
f.push(0);
f.push(1);
int f0=0,f1=1;
for(int i=2;i<30;i++)
{
int f2=f0+f1;
f.push(f2);
f0=f1;
f1=f2;

}
for(int i=0;i<29;i++)
{
cout<<f.pop()<<", ";
}
cout<<f.pop()<<endl;
return 0;
}

Kindly revert for any queries

Thanks.