it also like Pythagorean theorem; so the a[k] also with the value where a[j]-a[i]<a[k]<a[i]+a[j] and a[k]>a[j]>=a[i];
On 8月9日, 下午10时43分, Samba Ganapavarapu <[email protected]> wrote: > We have an array of integers, we need to find the element a[i],a[j] and a[k] > values where.. a[i]^2 + a[k]^2 = a[k] ^2 > what would be the fast algorithm to find ? > > - Samba -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
