Find out all possible (i,j,k) such that A[i]+B[j]=C[k].
You haven't succeeded in this at all.

You algorithm overrides values so that only one possible match for each `C[K]' is logged.

Any O(N*logN) or better algorithm for this ?
You can get better than "O(n*log(n))" without assuming weird constraints which are probably not intended.

I have already tried with sorting.Can you elaborate please ?
Show us your version that is based on sorting and searching.

Soma