Using Java

Given an array A of n elements. Find three elements i, j and k in the array such that A[i]2 + A[j]2 = A[k]2. Hints: Use Heapsort(A, n) For each array index i compute A[i]2 and store in array Search for two numbers in array from 0 to i-1 which adds to A[i].