/*
For loops. see Nyhoff P129ff
Fibonacci sequence is defined
fib(n)=fib(n-1)+fib(n-2)
https://en.wikipedia.org/wiki/Fibonacci_number
1) Change code to calculate the ratio of successive Fibonacci numbers fib(n)/fib(n-1)
and show it converges to the golden ratio (1+sqrt(5))/2
2) Change the order of a=b and b=fibn, what happens and why?
3) Increase N to 50, what happens and why?
*/
#include
using namespace std;
int main()
{
int N=20;
for (int n=3,a=0,b=1 ; n