The _____ sort algorithm sorts a list by recursively dividing the list in half until each sub-list has one element and then merging these sub-lists into the sorted order.
A) Merge
B) Quick
C) Linear
D) Lazy

Question

Quizplus · Accepted Answer

Merge sort algorithm is known for its divide and conquer approach where it recursively divides the list into halves until each sub-list has one element and then merges these sub-lists in sorted order.

The _____ Sort Algorithm Sorts a List by Recursively Dividing