Infinite Recursion

noun

say it: “IN-fih-nit rih-KUR-zhun” /ˈɪnfɪnɪt rɪˈkɜrʒən/

A function that keeps calling itself and never reaches a base case, until the program runs out of room and crashes.

What is infinite recursion?

Infinite recursion is a function that keeps calling itself and never reaches a stop, because its base case is missing or the calls skip past it, like a countdown by twos from 5 that only stops at exactly 0. The waiting calls pile up until the program crashes with a stack overflow.

In a sentence

  • “My countdown by twos skipped right over 0, so its base case never ran: infinite recursion.”

Level: Apprentice · More Data Structures terms at this level

Updated