Deals Of The Week - hours only!Up to 80% off on all courses and bundles.-Close
Introduction
The very basics
6. Recursion explained: syntax 2
Infinite looping
Processing trees with recursive CTE
Processing graphs with recursive CTE
Summary

## Instruction

Now, let's discuss the remaining parts of our example query. We'll paste it here again for your convenience:

First of all, note that we used UNION ALL to join the anchor member (SELECT 1) with all further recursive steps (SELECT previous_value + 1). Instead of UNION ALL, we could also use UNION, which will remove duplicate values from the recursion. In our case, no duplicate values exist, so there is no difference between UNION and UNION ALL.

Once the recursive CTE is completed and our temporary table is created, we need to query this table to actually see any results. That's why we put

SELECT *
FROM counter


outside the CTE. This part of the query is called invocation.

The animation below shows how our final recursive table is constructed.

Technically speaking, recursive CTEs do not use recursion, but iterations. Still, as the SQL keyword for this kind of queries is RECURSIVE, it is common to call such queries recursion. Treat it as some sort of convention rather than a technically accurate description.

## Exercise

Modify the example query so that it shows numbers from 20 to 5 (inclusive, in descending order).

### Stuck? Here's a hint!

Your anchor member will now be 20, because that's the starting point. Instead of adding one each time, subtract it. Continue the operation as long as the previous value is greater than 5.