1 votes 1 votes The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________. Ans: $\frac{8}{3}$ Algorithms algorithms merge-sort sorting + – kumar.dilip asked Jan 19, 2019 retagged Jun 30, 2022 by makhdoom ghaya kumar.dilip 666 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply muthu kumar commented Jan 19, 2019 reply Follow Share 2.67 ? 1 votes 1 votes kumar.dilip commented Jan 19, 2019 reply Follow Share How ?? 0 votes 0 votes muthu kumar commented Jan 19, 2019 reply Follow Share I'm thinking in this way. but is it necessary to add 4th case? 3 votes 3 votes kumar.dilip commented Jan 19, 2019 reply Follow Share Nice. No need to add the 4th case. 1 votes 1 votes himgta commented Jan 19, 2019 reply Follow Share @kumar.dilip @muthu kumar how case 2 and case 3 are different? 0 votes 0 votes Raja Singh commented Jan 20, 2019 reply Follow Share Is there any generic way for same?having n list of n elements 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I think answer will be like(total number of comarison/2) (2+2-1)/2=1.5 Raja Singh answered Jan 20, 2019 Raja Singh comment Share Follow See all 0 reply Please log in or register to add a comment.