Skip to main content

11 | Recursion

Recursion​

  1. True or False? A base case is not necessary for all recursive algorithms.
  2. Traversal of ____ is a good use case for recursion.
  3. True or False? A recursive definition is one in which the defined term appears in the definition itself.
  4. True or False? Recursion takes more computing resources than iteration.
  5. True or False? A function that calls itself recursively must have a plan to eventually stop