GATE | Gate IT 2007 | Question 78

Let P1,P2,…,Pn be n points in the xy-plane such that no three of them are collinear. For every pair of points Pi and Pj, let Lij 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 Pa and Pb is
(A) Θ(n)
(B) Θ(nlogn)
(C) Θ(nlogsup>2n)
(D) Θ(n2)


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
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.