ConceptSystems & CS
Base case
The first part of an induction proof that shows the statement is true for the initial value, usually zero.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Ana Bell
A simple case in a recursive function that can be solved directly without further recursion, providing the stopping condition.David J. Malan
The condition in a recursive function that stops further recursive calls and returns immediately.Francis Su
The first step of an induction proof showing the statement holds for 1.
Lectures that assume it
6Connections
19The lectures that define it or assume it, and the concepts next to it.