0 votes 0 votes Algorithms sorting merge-sort + – Anirban Biswas asked Jan 10, 2017 retagged Jun 18, 2022 by makhdoom ghaya Anirban Biswas 1.5k views answer comment Share Follow See 1 comment See all 1 1 comment reply Rahul Jain25 commented Jan 10, 2017 reply Follow Share Is it 82?? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Merge Sort is called $2*n-1$ times, merge function $n-1$ times. As it says about number of calls required for partitioning the array not sorting, so we calculate only number of times merge sort is called. so $x = 20*2-1 = 39$ $y = 4*39 +6 = 162$ smsubham answered Mar 1, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.