7 votes 7 votes The average case and worst case complexities for Merge sort algorithm are $O \: (n^2), O\: (n^2)$ $O \: (n^2), O\: (n \log_2 n)$ $ O\: (n \log_2 n), O \: (n^2)$ $ O\: (n \log_2 n), O\: (n \log_2 n)$ Algorithms isro2007 algorithms sorting merge-sort + – go_editor asked Jun 10, 2016 go_editor 2.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 11 votes 11 votes Answer D) both are O(nlog2n) srestha answered Jun 10, 2016 selected Jun 16, 2016 by rude srestha comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes All the three cases(Worst,Average,best) of Merge sort takes O(nlogn). akash.dinkar12 answered Apr 8, 2017 akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.