Lessons

Call Yourself

0 of 8 problems complete

1. Introduction

A procedure that calls itself uses recursion. Each call draws a little, changes an input, and calls again.

A base case such as if :n < 1 [stop] makes sure the calls eventually finish. Explore the complete examples below.

100%
Spd10

Read this section, then tap Next to start the first problem.