GATE | Gate IT 2007 | Question 78

Let P₁,P₂,…,P_n be n points in the xy-plane such that no three of them are collinear. For every pair of points P_i and P_j, let L_ij be the line passing through them. Let Lab be the line with the steepest gradient among all n(n−1)/2 lines.

The time complexity of the best algorithm for finding P_a and P_b is
(A) Θ(n)
(B) Θ(nlogn)
(C) Θ(nlogsup>2n)
(D) Θ(n²)


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save