Deals Of The Week - hours only!Up to 80% off on all courses and bundles.-Close

Wrap course as a gift

Prepare your gift and double-check it looks just right.

Form validation errors

Recipient's Name:
Recipient's Email:
Your Message (Optional):
Proceed to Checkout

Recursive Queries in PostgreSQL

Introduction
Quiz
9. Simple recursive CTE
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 two previous Fibonacci numbers. The first two Fibonacci numbers are 0 and 1.

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