Question

Which of the following problems can’t be solved using recursion?

(a) Factorial of a number

(b) Nth fibonacci number

(c) Length of a string

(d) Problems without base case

The question was asked in an online interview.

My doubt stems from Recursion topic in division Recursion of Data Structures & Algorithms II

Answer 1

The correct answer is (d) Problems without base case

To explain: Problems without base case leads to infinite recursion call. In general, we will assume a base case to avoid infinite recursion call. Problems like finding Factorial of a number, Nth Fibonacci number and Length of a string can be solved using recursion.