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 one of the following statements is incorrect about the desert locusts?
Size of ordinary rain drop varies from:
The most commonly used method of depreciation is
Which of the following type of mouth parts present in house fly?
Petroleum is a mixture of-
Pyricularin produced by Pyricularia oryzae causes:
Grouping of two or more than two consumers for a product or service so that their needs are better served, can be defined as-
Soils having white encrustation of soluble salts at the surface, known as __ ?
Indian Institute of Sugarcane Research (IISR) is situated in
Deficiency of which vitamin is prominent in those persons who continuously eat ‘polished rice’?