Glossary Term
Recursion
3 tags
1 category
The act of a function calling itself, recursion is used to solve problems that contain smaller sub-problems. A recursive function can receive two inputs: a base case (ends recursion) or a recursive case (resumes recursion).
The following Python code defines a function that takes a number, prints it, and then calls itself again with the number’s value -1. It keeps going until the number is equal to 0, in which case it stops.
Term Connections
Explore related terms connected by shared tags, shared categories, and relationship phrases. This map loads only when it comes into view.
Loading term connections…
