Sign inSign in
ConceptSystems & CS

Base case

The first part of an induction proof that shows the statement is true for the initial value, usually zero.
as Tom Leighton defines itMITThe wording closest to all 4 definitions
Watch it explained

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

4

Each in their own terms, from the easiest level.

  • Ana Bell

    MIT · Introductory

    A simple case in a recursive function that can be solved directly without further recursion, providing the stopping condition.
  • David J. Malan

    Harvard University · Introductory

    The condition in a recursive function that stops further recursive calls and returns immediately.
    • 2:08:59Memory Management, Pointers, and Buffer Overflows
  • Francis Su

    Harvey Mudd College · Undergraduate

    The first step of an induction proof showing the statement holds for 1.
    • 25:46Principle of Induction

Lectures that assume it

6

Connections

19

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.