Could u please elaborate ? I need an algo with O(N log N) time complexity and O(N) Space Complexity
On Nov 30, 9:24 pm, LALIT SHARMA <[email protected]> wrote: > according to my understanding... > > Least sqaure regression line concept can be used.. > > as it would be the line ..that has minimum deviation from all the points in > space. > > > > > > On Tue, Nov 30, 2010 at 9:48 PM, Prims <[email protected]> wrote: > > Given n points of structure > > struct point > > { > > double x; > > double y; > > }; > > Your function should return two points which are present on a line > > passing through maximum number of these n points. > > > -- > > 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]<algogeeks%2bunsubscr...@googlegroups.com> > > . > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. > > -- > Lalit Kishore Sharma > > IIIT Allahabad (Amethi Capmus) > 5th Sem- Hide quoted text - > > - Show quoted text - -- 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.
