Merge Sort

Question

Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.

Comments

@akash.dinkar12

But, correct ans given has 337 . I don't know how !

---

@VS

Don't worry our answer is perfect!!!

---

i got 379

Answer 1

for minimum:-

(70, 102)-:70

(172, 74)-:74

(246, 80)-:80

(246, 85)-:85

             ans=309

Answer 2

Given set {70,74,80,85,102}

Merge (70,74) = 70 comparisons

Merge (80,144) = 80 comparisons

Merge (85,224) = 85 comparisons

Merge (102,309) = 102 comparisons

 

Total no. of comparisons=70+80+85+102 = 337

I hope this helps!!