The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________.
I'm thinking in this way.
but is it necessary to add 4th case?
@muthu kumar how case 2 and case 3 are different?
I think answer will be
like(total number of comarison/2)