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 Chandigarh covers an area of ________
Where is Kandla Port located?
The GST Council, that takes all decisions regarding implementation of GST, is headed by
The Five year plan which recognized human development as the core of all development efforts?
Which of the following pairs (Organization - Headquarters) is incorrectly matched?
A) (UNICEF - New York City, U.S.)
B) (UNEP - Nairob...
Loan repayment by instalment payments is called as -
Who received the Nobel Prize for their work on the Photoelectric Effect?
Which of the following hydropower projects is NOT correctly matched with its respective river?
Malta recently became the 119th country to join the International Solar Alliance (ISA). On which continent is Malta located?
The Sultan Azlan Shah Cup is associated with which sport?