Open In App

ISRO | ISRO CS 2007 | Question 58

Like Article
Like
Save
Share
Report

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


Answer: (D)

Explanation: The best case, average case and worst case complexities for Merge sort algorithm are O( nlog2n ).

So, option (D) is correct.

Quiz of this Question


Last Updated : 25 Jun, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads