ta12_question

# ta12_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 12 1. (From “Computational Geometry” by de Berg, van Kreveld, Overmars, and Schwarzkopf) Let A be a set of numbers. Analyze the expected running time of the following procedure RandMax( A ). The set A in the first call to RandMax contains
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n distinct numbers. RandMax( A ) (a) If | A | = 1, return the number in A . (b) Otherwise, choose a random number x ∈ A . i. y := RandMax( A \ { x } ). ii. If y ≥ x , return y . iii. Otherwise, compare x with all other elements in A to con±rm that x is larger than them. Return x . 1...
View Full Document

• Spring '10
• may
• English, Computational complexity theory, Fall Semester Tutorial, van Kreveld, COMP 271H Design

{[ 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