I have a brute force solution with the time complexity of O(n^2ln(n))... how can we impove it? On 5月14日, 下午6时50分, PopUp <[EMAIL PROTECTED]> wrote: > I have brute force solution, this was asked in Google Interview. > > On May 14, 1:36 pm, "Cool Guy" <[EMAIL PROTECTED]> wrote: > > > > > I think that this problem is similar to cryptology. > > (Cryptology is method for one solution when exists a lot of numbers, but > > reverly think, I think that max collinear points will be find) > > > Actually, I don't have any idea. :) > > > Can you any idea for resolving this problem? > > > 2007/5/14, PopUp <[EMAIL PROTECTED]>: > > > > HI, > > > Great group!! > > > I have a problem, some of you might have heard about that. We have set > > > of n points in space. Now we have to find a set(with the max elements) > > > of collinear points or we can say find the max collinear points. > > > > Thanks, > > > Popup- 隐藏被引用文字 - > > - 显示引用的文字 -
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
