Which sort algorithm starts by cutting the array in half and then recursively sorts each half?
A)insertion sort
B)quicksort
C)merge sort
D)selection sort

Question

Quizplus · Accepted Answer

The sort algorithm that starts by cutting the array in half and then recursively sorts each half is called the Merge Sort. Therefore, the correct choice is C. The other options (A, B, and D) do not follow this approach.

Which Sort Algorithm Starts by Cutting the Array in Half