@shady: once the points are sorted by x values, y values in two saperate array's
we can minimize the set of points to be checked for (solution space) for every iteration) this minimization can be done using binary search on two sorted steps. the worst case is still O(n), but can significantly improve average case. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/XnevhrA56zMJ. 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.
