Question

The merge sort algorithm____________.A. Can be used only 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. E. None of the above.

Answer 1

Answer:

C. Works by merging two sorted vectors into one larger sorted vector

Explanation:

Merge sort is an efficient, general-purpose, comparison-based sorting algorithm.

Merge sort repeatedly breaks down a list into several sub-lists until each sublist consists of a single element and merging those sub-lists in a manner that results into a sorted list.