The merge sort algorithm:
A) Can only be used on vectors of even length.
B) Works by reducing vectors down to the base case of a two-element vector.
C) Works by merging two sorted vectors into one larger sorted vector.
D) Cannot be implemented recursively.

Question

Quizplus · Accepted Answer

The merge sort algorithm works by merging two sorted vectors into one larger sorted vector. It can be implemented recursively to repeatedly divide the vector into halves until each half consists of only one or two elements, which are then merged back together to form a sorted vector. The length of the vector does not have to be even for this algorithm to work.

The Merge Sort Algorithm