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.
The World Bank has approved a _______ loan to assist India in raising the standard of its technical education and expanding the number of jobs prospect...
Which Supreme Court ruling emphasized accessibility for people with disabilities (PwDs) as a fundamental right, highlighting the need for mandatory acce...
What is the primary purpose of the Mobile Number Revocation List (MNRL) introduced by the RBI?
Which country hosted COP29 in 2024?
What is the MSP set for raw jute for the 2025-26 marketing season?
Airbnb has inked an agreement with which state government’s Tourism Development Board to build host capacity in lesser-explored destinations & will ...
What is the primary purpose of the Unified Genomic Chip launched in Maharashtra's agriculture sector?
Identify the bank for which Rama Mohan Rao Amara has been recommended as Managing Director by FSIB.
In which country was India's first overseas Jan Aushadi Kendra inaugurated?