I have a write up in www.algorithmist.com for a UVa problem 270 - Lining Up. Check it out.
Its complexity is O(n^2 lg n). Best, -Lego On Jan 28, 2008 11:15 AM, vivek_12315 <[EMAIL PROTECTED]> wrote: > > Hi all, > I am fixed in this problem. It has also been asked in Google > interviews. > > Given n points in a plane, suggest an algorithm to find maximum no. of > collinear points ? > > Thanks in advance... > > > -- Fear of the LORD is the beginning of knowledge (Proverbs 1:7) --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
