Which of the following is true about the time complexity of Merge Sort?
Correct Option: Merge Sort (C) has a time complexity of O(n log n) in both the best and worst cases due to its divide-and-conquer approach, where the list is recursively split and merged. Why Other Options Are Wrong: A) O(n), O(n^2): Merge Sort does not have a quadratic time complexity in the worst case, nor does it achieve linear time in the best case. B) O(log n), O(log n): This is incorrect as merge sort deals with linear elements and requires O(n log n) time due to both sorting and merging. D) O(n), O(n log n): While some algorithms achieve linear time in the best case, Merge Sort consistently performs at O(n log n). E) O(n^2), O(n^2): This complexity is associated with algorithms like bubble sort in the worst case, not Merge Sort.
96.03% of √225.02 × 14.98 = ? + 19.98
47.87% of 749.76 + 35.11% of 399.76 = √? + 23.15 × 20.87
2720.03 ÷ 79.98 x 39.9 = ? + 40.32
33.33% of 110.99 = 19.98% × 244.97 - √?
3.55% of 8120 – 66.66% of 540 = ? – 28% of 5500
1359.98 ÷ 30.48 × 15.12 = ? × 4.16
(0.89 3 + 1.64 3 +2.76 3 ) ÷ 5.89 = ?
12.06 × 19.02 + 12.94 × 14.87 + 152.09 = ?% of 498.98
(?)2 + 9.113 = 31.92 – 39.03