We can do the following in 2-D plane where the pints are given in the form of (x.y).
For each selection of three points do the following: Find the area of the triangle of the three points. Let it be A. If A is zero then Print "Existence of Co-linear points" Break. This can be achieved in C(n,3) steps so the time complexity is n(n-1) (n-2)/6 = O(n^3). -- 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.
