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.
The Kuznets Curve depicts the relationship between:
Who has recently partnered with the Election Commission of India for information on voting process?
Which compound is referred to as "white vitriol"?
Who has been appointed as the new Secretary General of ASSOCHAM in 2025?
Who captained the Indian U19 Women’s team to their first ICC U19 Women’s T20 World Cup title in 2023?
- Which Indian state is home to the Mayurbhanj district, known as the last among the princely states to merge?
The percentage of deposits that a bank must keep as cash reserves with itself is known as ____?
If CORRUPTION is coded as 9 and ALLEGATIONS as 10, then what is the code for INCREASING?
What is the primary goal of the Namami Gange Mission?
SmartFin, an end-to-end digital supply chain finance (SCF) platform, powered by Veefin Solutions has been launched that will help drive the required o...