Question

Write a program that, given two sorted arrays of N int values, prints all elements that appear in both arrays, in sorted order. The running time of your program should be proportional to N in the worst case

Answer 1

merge sort,for example,there are two array, a={1,3,5},b={2,4,6},give two index ia=0,ib=0; each time you compare a[ia] and b[ib],get the smaller one and let the index(ia or ib) increase,when one of the array was in the end,you check whether the other array is in the end,if not get the remained. may you can google the merge sort.

Answer 2

lena is length of a,lenb is length of b;
ia=0,ib=0;
while(ia<lena&&ib<lenb) {...}
while(ia<lena) {get(a[ia]);ib++;}
while(ib<lenb) {get(b[ib]);ib++;}