In recursion, the condition for which the function will stop calling itself is ____________
(a) Best case
(b) Worst case
(c) Base case
(d) There is no such condition
The question was posed to me in an online quiz.
I would like to ask this question from Recursion in division Recursion of Data Structures & Algorithms II