Ace Test Series: Algorithm - Merge Sort

Question

Comments

C. 

At every level, in best case, $n/2$ comparisons and total $logn$ levels...Hence, $nlogn/2$

---

why n/2 comparisons. I think n comparisons at each level.

---

In best case, $n/2$ comparisons. Say Two given arrays are : (1,2,3) and (4,5,6)..You can see that when merge procedure applied on these two sorted subarrays..You will have $3$ comparisons and $6$ moves.

---

(nlogn)/2........ total levels logn and comparison is n/2 at every level so we get this answer