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.
25% of 60 × 15% of 120 = 30% of (?)
262 × 15 + (?)² = 4099
20% of 550 × 25% of 80 = ?2 × 22
(15 × 225) ÷ (45 × 5) + 480 = ? + 25% of 1240
Ravi is 12 years younger than Surya. Ravi's age is 40% of the sum of his and Surya's age. What will be Surya's age 9 years hence?
115 ÷ 23 + 12 × 6 = ? + 16 - 35
3.55 + 1.05 + 2.5 × 13 – 12% of 12.5 = ?
120% of 400 + ?% of 520 = 1000
432 ÷ ? × 2552 ÷ 44 = 2088