Unformatted text preview: A have the same value? [27] 4. What are the two ways to resolve collisions when constructing a hash table? [14] 5. Suppose that you have a “black box” worstcase linear time median subrouting. Give a simple, linear time algorithm that solves the selection problem for an arbitrary order statistics. [27]...
View
Full
Document
This note was uploaded on 11/19/2009 for the course CS CMPT 307 taught by Professor A.bulatov during the Fall '09 term at Simon Fraser.
 Fall '09
 A.BULATOV
 Data Structures

Click to edit the document details