thanks @dave
*Shashi Kant * ***"Think positive and find fuel in failure"* *System/Software Engineer* *Hewlett-Packard India Software Operations. * On Mon, Oct 1, 2012 at 10:42 PM, Dave <dave_and_da...@juno.com> wrote: > @Shashi: It has been discussed before, and an O(n^2 log n) solution is > outlined at > https://groups.google.com/d/msg/algogeeks/fBhXY9aUNJ0/CTB_p7uO8YYJ and is > given in more detail at > https://groups.google.com/d/msg/algogeeks/fBhXY9aUNJ0/0S0zK6HdKdMJ. > > Dave > > On Monday, October 1, 2012 12:00:19 PM UTC-5, Shashi Kant wrote: > >> Given a two dimensional graph with points on it, find a line which passes >> the most number of points. >> Can somebody suggest possible ways to do it. >> >> *(or point me to the post if this problem is already discussed)* >> >> >> >> *Thanks & Regards,* >> *Shashi Kant * >> ***"Think positive and find fuel in failure"* >> http://thinkndoawesome.**blogspot.com/<http://thinkndoawesome.blogspot.com/> >> *System/Software Engineer* >> *Hewlett-Packard India Software Operations. >> * >> >> >> -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/TW09gurbAN0J. > To post to this group, send email to algogeeks@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. > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
