Thanks Dave....nice solution On Nov 30, 9:56 pm, Dave <dave_and_da...@juno.com> 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 <topcode...@gmail.com> 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 algoge...@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.
