14 views
while merging two sorted array of size m,n respectively why total number of comparision is m+n-1?.

suppose

1st list  contain 2,3

2nd list containn 4,5,6

insert infinity in first list at end and infinity in second list at end.

1st  comparison of (2,4)  ----------->2 will come in Final Array

2nd comparison of (3,4) ----------->3 will come in Final Array

3rd comparison of (infinity, 4)----------->4 will come in Final Array

4th comparison of (infinity,5)----------->5 will come in Final Array

5th comparison of (infinity,6)----------->6 will come in Final Array

so according to above procedure there will be total of m+n comparision i.e here 5.
ago | 14 views

After you insert $5$ into the result array, there is only one element ($6$) left. Why do you need another comparison to insert it ? That is where the $-1$ comes into picture.
Technically, in this example - it will take less than $m+n-1$ comparisons. After you insert $3$, left array is empty. And since right array is already sorted - you can insert into the result array directly without further comparisons.
$m+n-1$ is the upper bound.