Hi Malay,
Thanks for the solution.
Thanks,
Raghavendra
On Tue, Jun 3, 2008 at 5:02 PM, Malay Bag <[EMAIL PROTECTED]> wrote:
> Please consider this method...
>
> with respect to first point sort (in place) other n-1 ponits comparing the
> angles (between the horizontal line passing through 1st p
Please consider this method...
with respect to first point sort (in place) other n-1 ponits comparing the
angles (between the horizontal line passing through 1st point and the line
passing through 1st point and current point)... (nlogn) (merge sort may be
used)
checke for 3 collinear points (nlogn
Hi Guys,
Can anyone please give me a solution for this??
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,
Raghavendr
