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.
In the question below, a sentence is given, four words have been highlighted in bold. Find out if the words are appropriate (grammatically and context...
Proximity
(I) People have also been warned against coming in proximity with electricity poles or taking shelter under trees or in dilapidate...
Select the most appropriate ANTONYM of the word established from the given sentence:
Siben feels great satisfaction and gratified when he finds...
He was wrongly blamed for something his friends did, and was upset for over a month.
Prerogative
Foil
I The Indian Army has foiled a major infiltration bid along the Line of Control in Jammu and Kashmir’s Poonch sec...
Select the correctly spelt word.
In the following question, a word has been given and there are three ways in which the word has been used, in similar or different forms. You need to s...
cast
I. The discovery of the dinosaur skeleton has cast light on why they became extinct.
II. The new blockbuster has a very popular...
PERJURE
I. The assumption is that he had attained citizenship, either through marriage or through naturalization, and at that point may have b...