Start learning 50% faster. Sign in now
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.
Which ecologist is famous for studying plant life in the Indiana Dunes in 1896?
What does D stands for in GDP?
In November 2021, Pratap Singh Khachariyawas was allocated food and civil supplies in the Cabinet expansion of the state of ______.
Store house of malarial parasite in our body is
Who received the Dinanath Mangeshkar award for 2015?
Which of the following companies manufacturers Surf Excel?
Which of the following statements about the Mudra Yojana is NOT correct?
Which interest rate is offered under the PM Vishwakarma Scheme for collateral-free credit support?
The COP is the supreme decision-making body of the United Nations Framework Convention on Climate Change. Which countries will host the COP 29 & COP 30?
The ______ is celebrated at Shilpgram in February every year.