CSCE 3110 Data Structures
Assigment 5
Total: 60 points
Issued: 04/16/2006
Due: 04/30/2006
................................

1. (20 points) Suppose that, instead of sorting an entire file,
we only want to determine the mth smallest of n elements. Show
that quicksort can be adapted to this purpose, avoiding many of
the computation required to do a complete sort. Write  the pseudo
codes for your algorithm. Analyze the running time. Give enough
comments and explanations for your algorithm.

2. (20 points) Write pseudocode that implements a function MinToMax() that 
turns a MinHeap into a MaxHeap. Analyze the running time. Give enough
comments and explanations for your algorithm.


3. (25 points) Draw the 11 item hash table that results from using the hash
function h(i) = (2i+5) % 11
to hash the keys 3, 8, 102, 23, 4, 10, 9, 12, 44, 23
assuming:
	a. open hashing
	b. closed hashing


Submission instructions:  
   -  submit a hard copy of the solutions to problmes 1-3 on the due date of 
      the class
   -  note: this assignment is optional, it will replace your lowest score of
      your previous 4 assignments