1 votes 1 votes Algorithms ace-test-series algorithms merge-sort + – Shankar Kakde asked Jun 11, 2018 edited Mar 3, 2019 by I_am_winner Shankar Kakde 609 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Deepak Poonia commented Jun 11, 2018 reply Follow Share C. At every level, in best case, $n/2$ comparisons and total $logn$ levels...Hence, $nlogn/2$ 2 votes 2 votes Shankar Kakde commented Jun 11, 2018 reply Follow Share why n/2 comparisons. I think n comparisons at each level. 0 votes 0 votes Deepak Poonia commented Jun 11, 2018 reply Follow Share 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. 1 votes 1 votes Navneet Kalra commented Jun 29, 2018 reply Follow Share (nlogn)/2........ total levels logn and comparison is n/2 at every level so we get this answer 0 votes 0 votes Please log in or register to add a comment.