McqMate
| Q. |
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 |
| Answer» D. problems without base case | |
| Explanation: 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 | |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet