2,174 views
7 votes
7 votes

The average case and worst case complexities for Merge sort algorithm are

  1. $O \: (n^2), O\: (n^2)$
  2. $O \: (n^2), O\: (n \log_2 n)$
  3. $ O\: (n \log_2  n), O \: (n^2)$
  4. $ O\: (n \log_2  n),  O\: (n \log_2 n)$

2 Answers

Best answer
11 votes
11 votes

Answer D)

both are O(nlog2n)

selected by
Answer: