Logo Trail
0 of 8 problems complete
A procedure that calls itself uses recursion. Each call draws a little, changes an input, and calls again.
calls itself
A base case such as if :n < 1 [stop] makes sure the calls eventually finish. Explore the complete examples below.
base case
if :n < 1 [stop]
Read this section, then tap Next to start the first problem.