On January 21th at 14:15 UTC , progression through exercises will be unavailable for 10 minutes due to a planned maintenance break.
Deals Of The Week - hours only!Up to 80% off on all courses and bundles.-Close
Introduction
Quiz
9. Simple recursive CTEs
Summary

Instruction

Ok. Let's move on to recursion and start with something simple.

Exercise

Fibonacci numbers are numbers that follow the pattern given below:

F(n) = F(n-2)+F(n-1)

Each Fibonacci number is the sum of the two previous Fibonacci numbers. The first two Fibonacci numbers are 0 and 1.

Print a single column that will show all Fibonacci numbers smaller than 100. Name the column Fib.