EGAVE

base case

About 0.52 uses per million words.

Meaning

  1. noun The part of a recursive definition or algorithm that is not defined in terms of itself.
  2. noun The basis in mathematical induction, showing that a statement holds when n is equal to the lowest value that n is given in the question (usually 0 or 1).

Similar words

recursion primitive recursion recursive definition base unit inductive definition base infinite recursion root indeterminant indeterminate

Save “base case” to learn later