Can pls someome. Tell.number of comparisons in. Merge sort in best case as well as worst case.
Acc to. Me, at. Each level we need O(n) comaprisons and number of levels are log n in merge sort(whether it. Is a best case or worst case).hence mumber o comparisons should be nlogn in worst case as well as best case.
Pls guide me.