Which of the following algorithms is most easily expressed recursively?
A) linear search
B) quick sort
C) bubble sort
D) selection sort
E) none of the above algorithms are easily expressible recursively

Name: Which of the following algorithms is most easily expressed recursively? A) linear search B) quick sort C) bubble sort D) selection sort E) none of the above algorithms are easily expressible recursively
Brand: Quizplus
Rating: 4.9 (29 reviews)

Question

Quizplus · Accepted Answer

Quick sort is easily expressible recursively.

Which of the Following Algorithms Is Most Easily Expressed Recursively