In merge sort, the total effort to reconstruct the sorted array through merging is ____. A) O(1) B) O(log₂n) C) O(n log n) D) O(n²)

Name: In merge sort, the total effort to reconstruct the sorted array through merging is ____. A) O(1) B) O(log 2 n) C) O(n log n) D) O(n 2 )
Brand: Quizplus
Rating: 5.0 (37 reviews)

Question

Quizplus · Accepted Answer

Merge sort has a time complexity of O(n log n) for the merging process, as it divides the array into halves and then merges them, requiring log n divisions and linear time to merge each level.

In Merge Sort, the Total Effort to Reconstruct the Sorted