Anyone can tell me how to make fibonacci ranks order without recursion in c++?

Question

i still cant figure it out

Answer 1

#include <iostream>
using namespace std;
int main() {
int n1=0,n2=1,n3,i,number;
cout<<"Enter the number of elements: ";
cin>>number;
cout<<n1<<" "<<n2<<" "; //printing 0 and 1
for(i=2;i<number;++i) //loop starts from 2 because 0 and 1 are already printed
{
n3=n1+n2;
cout<<n3<<" ";
n1=n2;
n2=n3;
}
return 0;
}

Answer 2

Not C++, but the same logic in one line.

https://code.sololearn.com/cxpVnO0J3v5H/#java