ISRO | ISRO CS 2007 | Question 58

The average case and worst case complexities for Merge sort algorithm are
(A) O ( n² ), O ( n² )
(B) O ( n² ), O ( n log₂n )
(C) O ( n log₂n ), O ( n²)
(D) O ( n log₂n ), O ( n log₂n )

Answer: (D)
Explanation: The best case, average case and worst case complexities for Merge sort algorithm are O( nlog₂n ).

So, option (D) is correct.
Quiz of this Question