Given N points on a circle, centered at the origin, design an algorithm that determines whether there are two points that are antipodal, i.e., the line connecting the two points goes through the origin. Your algorithm should run in time proportional to N log N.
My logic is : 1) Sort the given points on the basis of their X-coordinates (NlogN) 2) Select first point and Binary Search for negative of its X- coordinate (LogN) 3) If it returns true we are done else select sencond point and so on....(NlogN in worst condition) Am i Correct ??? Any more solutions ??? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
