Is there any specific need to use recursion? One alternate is to find slope and constant (m and c) for every pair of points and same value of m & c will specify the points on the same line. Time complexity is O(n*n).
On Sat, Oct 23, 2010 at 4:31 PM, Meng Yan <mengyan.fu...@gmail.com> wrote: > Given n point on the plane, find out whether any 3point on the same line. > > How to use recursion to solve the problem? Could you help me find the > algorithm and give the time complexity? > > Bests, > Claire > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@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.
