The ________ algorithm uses recursion to efficiently sort a list.
A)shell sort
B)quicksort
C)binary sort
D)red/black sort
E)None of these

Question

Quizplus · Accepted Answer

Quicksort is a divide-and-conquer algorithm that sorts an array by partitioning it into two subarrays, then recursively sorting the subarrays while choosing a pivot. The use of recursion makes it a very efficient sorting algorithm, with an average time complexity of O(n log n). Shell sort, binary sort, and red/black sort are not recursive algorithms.

The ________ Algorithm Uses Recursion to Efficiently Sort a List