Can we find any alg. which runs faster than O(n^2) using these 2 axioms ? 2011/8/10 Amethy hobby <news...@gmail.com>
> 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 <sambasiv...@gmail.com> 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
