ta2_question

# ta2_question - COMP 271H Design and Analysis of Algorithms...

• Notes
• 1

This preview shows page 1. Sign up to view the full content.

COMP 271H Design and Analysis of Algorithms 2006 Fall Semester Tutorial 2 Solution 1. You are given a set S of n points in the plane. p S , we use p x and p y to denote its x - and y -coordinates. We assume that p x = q x and p y = q y for any two points p, q S . A point p S is maximal if for any other point q S , q x < p x or q y < p y . Design a divide-and-conquer algorithm to compute the maximal points in
This is the end of the preview. Sign up to access the rest of the document.

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
• may
• English, Big O notation, Fall Semester Tutorial, COMP 271H Design, qx < px

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern