Question
Which of the following is true about the time complexity
of Merge Sort?Solution
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.
Participatory plant breeding (PPB) is what type of program
The Nobel Prize in Physiology or Medicine 1948 was awarded to Paul Hermann Müller for his
discovery of which high efficiency contact poison ag...
The person considered as father of extension in India:
The main aim of plant breeding is
What is the rank of India in fruit production?
Self-incompatibility does not exist in which mango variety
The abiotic component of agro-ecological zone comprises of
When a prolonged drought results in drying of available water sources like streams, tanks, reservoirs, wells etc., it is called as
Which app provides information on ornamental fish in eight Indian languages?
Light-stable synthetic pyrethroids, which is registered to control mites