Recursion

Recursive algorithms call themselves indefinite times until they finish.

1. Each recursive call should be a smaller instance of the same problem.
2. The recursive calls must eventually reach a base case, which is solved without further recursion.

Recursive art

• Koch_snowflake
• L-system