Glossary: Data Structures and Algorithms
Base case
Also written: base cases
The input a recursive function can answer directly without calling itself, such as an empty list in `sum_list`. Without one, recursion never stops.
Glossary: Data Structures and Algorithms
Also written: base cases
The input a recursive function can answer directly without calling itself, such as an empty list in `sum_list`. Without one, recursion never stops.