HW 3 		Due 26th March.
====


1-6. 
Do the following six exercises from [DPV]: 2.13, 2.14, 2.15, 2.17, 2.22, 2.23 (a).

7.
Suppose you have a subroutine that can find the median of a set of n items (i.e., 
the (n/2) smallest) in O(n) time. Give an algorithm to find the kth biggest 
element (for arbitrary k) in O(n) time.