ya.....i was absolutely wrong ..regarding the solution ..dere is much more for me ..to learn....
On Tue, Nov 30, 2010 at 10:47 PM, Prims <[email protected]> wrote: > Thanks Dave....nice solution > > On Nov 30, 9:56 pm, Dave <[email protected]> wrote: > > @Prims: I gave an O(n^2 log n) algorithm to find the maximal number of > > collinear points inhttp:// > groups.google.com/group/algogeeks/msg/d329dda12b332dd1. > > > > Dave > > > > On Nov 30, 10:18 am, 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.- 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Lalit Kishore Sharma IIIT Allahabad (Amethi Capmus) 5th Sem -- 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.
