Let P1,P2,…,Pn be n points in the xy-plane such that no three of them are…
PYQ GATE 2007
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.
Θ(n log n)
- C.
Θ(n log² n)
- D.
Θ(n²)
Attempted by 206 students.
Sign up free to check your answer
Sign up freeLoading lesson…