Start learning 50% faster. Sign in now
Get Started with ixamBee
Start learning 50% faster. Sign in nowCorrect 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.
Mist chamber is used
The NAVSTAR Global Positioning System is maintained by
Which crop is having goitrogenic effect?
The nodal agency for the holistic development of seafood industry, including export of marine products in india is
Which of the following is not an innovative technique of minimal processing
India’s agricultural exports crossed $50 billion during the fiscal year 2021-22. Which crop recorded highest quantity exported in 2021-22?
Which color sticky traps are used for aphids and white fly?
Which is not a method of food preservation
What is the specific gravity of cow milk?
" खाद्य व्यवसाय ऑपरेटर " वह व्यक्ति है जो :