O(n^2 logn) solution to 3SUM

ThreeSum.java

    // Complexity - O(n^2 logn)
    private int[] findTriple_2(int[] A) {
        Arrays.sort(A); // O(nlogn)
        for (int i = 0, l = A.length; i < l && A[i] < 0; i++) { //O(n^2 logn)
            for (int j = i + 1; j < l && A[i] + A[j] < 0; j++) {
                int k = Arrays.binarySearch(A, j + 1, l, -A[i] - A[j]);
                if (k > j) return new int[]{A[i], A[j], A[k]};
            }
        }
        return null;
    }