Hi, this is odd, i'm solving a problem but i don't know its name.

The problem is the following:

There are 2 (ordered) numbers array V and W.

We have to find a number k which is the result of V[i]+W[j].

There is a literature algorithm which solves it:

i=0;

j=size(W);

while(true)

If (V(i)+W(j)==k)

return i,j;

else if V(i)+W(j)>k

j--;

else if V(i)+W(j)<k

i++

Do you remember the name of the problem or the name of the algorithm?

Thank you.