Unformatted text preview: O ( n log n ) time. Further discussion: (a) Suppose we know in advance, there are only constant number of maximal points in our solution. Can we design a better algorithm to solve the problem? 1...
View Full Document
- Spring '10
- English, Big O notation, Fall Semester Tutorial, COMP 271H Design, qx < px