Fibonacci sequence

Question

Fibonacci sequence

Accepted Answer

The anchor starts with (a=0, b=1). Each recursive step shifts: new a = old b, new b = old a + old b. Iterations produce (0,1), (1,1), (1,2), (2,3), (3,5), (5,8), (8,13). At (8,13), b=13 >= 10 so recursion stops. SELECT a gives 0, 1, 1, 2, 3, 5, 8. The first 5 are 0, 1, 1, 2, 3. Selecting b instead of a shifts the sequence by one position and gives 1, 1, 2, 3, 5. The values 1, 2, 3, 5, 8 would result from selecting a+b each row rather than a.