retagged by
666 views
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}$

retagged by

1 Answer

0 votes
0 votes

I think answer will be 
like(total number of comarison/2)

(2+2-1)/2=1.5

Related questions

1 votes
1 votes
3 answers
1
Shubhanshu asked Jun 6, 2017
1,602 views
You are asked to sort 15 randomly generated numbers. One should prefer—(a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sortI think the answer should be c or d cr...
0 votes
0 votes
3 answers
2
aditi19 asked Oct 6, 2018
1,128 views
what is the recurrence relation for merge sort?