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.

Question

Quizplus · Accepted Answer

Merge sort works by dividing a vector into two halves, sorting each half recursively, and then merging them back together. This process continues recursively until the base case of a two-element vector is reached. The two halves are merged back together by creating a new vector and inserting elements in order from both halves. This results in a larger sorted vector. The length of the original vector does not have to be even.

The Merge Sort Algorithm