Fibonaci numbers with loop( not recursion)

Question

Can you show me the loop only which show till Nth fibonaci numbers

Answer 1

//why don't you try yourself
https://www.sololearn.com/Discuss/1035209/?ref=app

Answer 2

https://code.sololearn.com/c6ErdwUmKLPK/?ref=app

Answer 3

#include <iostream>

int main(){
int n1=0,n2=1,indexTo=20;
while(indexTo--){
std::cout<<n1<<"\n";
n1+=n2;
n1^=n2;
n2^=n1;
n1^=n2;
}
return 0;
}
//^= there for swap n1 and n2

Answer 4

@Gaurav actually fibonacci is part of my program. Answer you provided was modified by me, So i'm not so dumb to copy and paste your answer. Just couldn't think of algorithm, we are all humans after all. It happens. ANYWAY. THANK YOU, helped me a lot

Answer 5

//here is my code
https://code.sololearn.com/c22rEcgbpmXi

Answer 6

Couldn't