Question
Which data structure or concept is best described as a divide-and-conquer sort that merges sorted subarrays?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Merge Sort
Explanation:
Merge Sort is a divide-and-conquer sort that merges sorted subarrays.
This description distinguishes it from the other choices.
Leave a Reply