@Dave O(n^2lgn) will exceed given time limit question contains some constraints, that should be used to overcome time limit in general your algorithm is good enough i think !!
On Wed, Feb 2, 2011 at 8:21 PM, Dave <[email protected]> wrote: > @TR: See my algorithm at > http://groups.google.com/group/algogeeks/msg/d329dda12b332dd1. > It is of complexity O(n^2 log n). > > Dave > > On Feb 2, 7:11 am, tech rascal <[email protected]> wrote: > > In a plane given n points (x1,y1) (x2,y2)....(xn,yn), find the the > > maximum number of collinear points. > > plz tell me the best way to do that. > > -- > 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. > > -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- 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.
