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(nlog2n)

Question

Quizplus · Accepted Answer

Merge sort has a time complexity of O(nlogn) in both the worst and average cases due to its divide-and-conquer approach, which consistently splits the array and merges sorted subarrays.

The Behavior of Merge Sort Is ____ in the Worst