Hi,
On a plane if there are n points. How to find out if there are three (3) points which are collinear in O(N**2log n) time. I got a solution which uses extra space. But i need a solution which doesn't use any extra space. Thanks, Raghavendra --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
