Recursive Case

noun

say it: “rih-KUR-siv KAYS” /rɪˈkɜrsɪv keɪs/

The part of a recursive function that calls the function again on a smaller piece of the problem and uses what comes back.

What is a recursive case?

The recursive case is the part of a recursive function that hands a smaller piece of the problem back to the same function and uses what comes back: to count nesting dolls, 1 for this doll, plus the count of the doll inside.

In a sentence

  • “In the recursive case, the sum is the first number plus the sum of the rest of the list.”

Level: Apprentice · More Data Structures terms at this level

Updated