Skip to content

Glossary: Algorithms Beyond the Basics

Base case

Also written: base cases

The simplest situation in a recursive function, where it returns an answer directly without calling itself again. In `subsets` it is reached when every item has been decided.

Where the book teaches it

Related terms

BacktrackingMemoization