Question

C++ ONLY

a) Write a non-recursive implementation of Fibonacci function that uses stack (you can use STL stack).

b) Calculate the complexity of your algorithm.

Answer 1

******************************************************************************************
Please Upvote the answer as it matters to me a lot :)
*****************************************************************************************
As per HomeworkLib expert answering guidelines,Experts are supposed to answer only certain number of questions/sub-parts in a post.Please raise the remaining as a new question as per HomeworkLib guidelines.
******************************************************************************************

#include <bits/stdc++.h>
using namespace std;

int Fibonacci(int n)
{
stack <int>s ;
s.push(0);
n--;
s.push(1);
n--;
while(n)
{
int top,belowTop,current;
top= s.top();
s.pop();
belowTop= s.top();
current= top+ belowTop;
s.push(top);
s.push(current);
n--;
}
return s.top();
}

int main() {
cout<<Fibonacci(6);
return 0;
}