Of the numerous sorting algorithms, what algorithm employs a recursive, divide-and-conquer strategy that breaks a list in two at the middle point and recursively sorts the lists?
A) quicksort
B) insertion sort
C) bubble sort
D) merge sort

Question

Quizplus · Accepted Answer

Merge sort is the sorting algorithm that employs a recursive, divide-and-conquer strategy to sort a list by breaking it into two halves, sorting each half individually and then merging them back together to form the final sorted list. It has a time complexity of O(n log n) and is considered efficient for large data sets. Quick sort also employs a similar divide-and-conquer strategy but has a worst-case time complexity of O(n^2) which makes it less efficient. Insertion sort and bubble sort have a time complexity of O(n^2) which makes them less efficient than merge sort for large data sets.

Of the Numerous Sorting Algorithms, What Algorithm Employs a Recursive