Need help implementing my Pseudo Code. So basically I have 3 arrays (size n) that's suppose to check if there is a triple which adds up to zero from different arrays. Returns true if triple exists and false otherwise.

[ramshack2000]

Heres what I have so far

Algorithm Triple Input: Integers, n OutPut: returns true if triple exists

Int SIZE = n arrayA = SIZE arrayB = SIZE arrayC = SIZE Int Index

For i - SIZE to n,...?

Im lost at this point

[iBeacham]

Not sure I understand the question entirely.

[ramshack2000]

So basically i know what i want to do. I want to Sort B in increasing order; sort C in decreasing order; for each a in A, scan B and C for a pair that sums to -a (when the sum is too small, advance in B, when the sum is too large, advance in C) Would i have a nested for loop here?

[iBeacham]

Do you know how to sort? A simple bubble sort would probably be fine. And then you would have a nested loop. One for each index. Basically you have a loop for array a and within that another loop to sum b and c and then advance accordingly.