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

Name: Which sort algorithm starts by cutting the array in half and then recursively sorts each half? A) insertion sort B) selection sort C) merge sort D) quicksort
Brand: Quizplus
Rating: 4.7 (28 reviews)

Question

Quizplus · Accepted Answer

Merge sort is a divide-and-conquer algorithm that divides the array into halves, recursively sorts each half, and then merges the sorted halves.

Which Sort Algorithm Starts by Cutting the Array in Half