Mathematical proof of 2 way merge sort
Calculate the minimum and maximum no of element comparisons involved in 2 way merge sort, assuming n =2^k , (k > 0) , n is not a power of 2
Mathematical proof of 2 way merge sort
Calculate the minimum and maximum no of element comparisons involved in 2 way merge sort, assuming n =2^k , (k > 0) , n is not a power of 2