title: Number of Comparison in Worst Case of Merging Two Sorted Array?
body: <p>Given two sorted arrays <code>A, B</code> with size <code>n</code> and <code>m</code>. I am looking for worst number of comparison that merges these two arrays.</p>
  
  <p>1) n+m-1</p>
  
  <p>2) max(n,m)</p>
  
  <p>3)min (m,n)</p>
  
  <p>4) mn</p>
  
  <p>I know this is not a good question because the merge algorithm not mentioned, but i think, The normal merge sort algorithm - merge step with normally apply <code>n + m -1</code> comparisons, where one list is of size n and and the other list is of size m. Using this algorithm is the most simplest approach to combine two sorted lists. any expert could help me, am I right by choosing (1)? </p>