+1 vote
in Data Structures & Algorithms II by (110k points)
What is the worst case time complexity of merge sort?

(a) O(n log n)

(b) O(n^2)

(c) O(n^2 log n)

(d) O(n log n^2)

This question was addressed to me during an online exam.

My query is from Sorting in section Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
Correct answer is (a) O(n log n)

Best explanation: The time complexity of merge sort is not affected by worst case as its algorithm has to implement the same number of steps in any case. So its time complexity remains to be O(n log n).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.