Which of the following problems can be programmed recursively?
A) Towers of Hanoi
B) Quicksort
C) Binary search
D) All of the above

Question

Quizplus · Accepted Answer

All of the above problems can be programmed recursively. 
- Towers of Hanoi can be solved using the recursive function in which the task is divided into smaller sub-tasks and then each sub-task is solved recursively.
- Quicksort also uses recursion by dividing an unsorted list into two smaller sublists and then sorting each sublist recursively. 
- Binary search can also be implemented recursively by dividing the sorted list or array into smaller sub-lists and searching for the target element recursively.

Which of the Following Problems Can Be Programmed Recursively