ta12_question - n distinct numbers. RandMax( A ) (a) If | A...

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

View Full Document Right Arrow Icon
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 ±rst call to RandMax contains
Background image of page 1
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

This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.

Ask a homework question - tutors are online