The behavior of merge sort is ____ in the worst case and ____ in the average case. A) O(nlog₂n), O(nlog₂n) B) O(n²), O(n) C) O(nlog₂n), O(n²) D) O(n²), O(nlog₂n)

Question

Quizplus · Accepted Answer

Merge sort has a time complexity of O(n log n) in both the worst case and the average case, due to its divide-and-conquer approach that splits the array into halves and merges them in sorted order.

The Behavior of Merge Sort Is ____ in the Worst