Question

What is the best case and worst case in complexity of merge sort?

Answer 1

what is your question

Answer 2

In the worst case, merge sort does about 39% fewer comparisons than quicksort does in theaverage case. In terms ofmoves, merge sort's worst case complexity isO(n log n)—the same complexity as quicksort's best case, and merge sort's best case takes about half as many iterations as the worst case.