Which of the following algorithms use recursion for sorting an array of…

Both Quick Sort and Merge Sort use recursion. Quick Sort is a Divide and Conquer algorithm. It selects a pivot element, partitions the array, and recursively sorts the subarrays.

Merge Sort is also based on the Divide and Conquer approach, where the array is recursively divided into halves and then merged in sorted order.