Question: You are given a set S = {p_1 ... p_n} of points in 2D. Each point is given as its x and y coordinates. Suggest

You are given a set S = {p_1 ... p_n} of points in 2D. Each point is given as its x and y coordinates. Suggest an O (n62 log n) time algorithm that determines if any 3 of them are collinear. Your algorithm should not use the operations division, nor trigonometric operations
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
