Cacher is the code snippet organizer for pro developers

    // Complexity - O(n^2)
    private int[] findTriple_4(int[] A) {
        Arrays.sort(A);
        for (int i = 0,l = A.length; i < l; i++) {
            int left = i + 1, right = l - 1;
            while (left < right) {
                int s = A[i] + A[left] + A[right];
                if (s == 0)
                    return new int[]{A[i],A[left], A[right]};
                else if (s > 0)
                    right--;
                else
                    left++;
            }
        }
        return null;
    }