Closest pair sum in two sorted arrays

Question

Given two sorted arrays of integers, a and b, and an integer c, I have to find i,j such that:

a[i] + b[j]         


        

Answer 1

I think you dont have to search the whole array b[] next time.......u have to search in between starting of array b and the lowest bound u found till now....for the next element in a[].It would definitely reduce your time complexity...and when u find the given target 'c' you must stop your search.