st0le
7/1/2013 - 9:33 PM

O(n^2 logn) - Triplet Solution

O(n^2 logn) - Triplet Solution

gistfile1.txt
content_copyfile_download
FIND-TRIPLET-2(A,B,C)
SORT(C)
FOR i = 1 to len(A)
	FOR j = 1 to len(B)
		k = BINARY-SEARCH(C,-A[i]-B[j])
		if k > 0
			RETURN {A[i],B[j],C[k]}
RETURN {}
END FUNCTION