\documentstyle[11pt,handout]{article}
\begin{document}
\input{localmacros}
\input{macros}
\thispagestyle{empty}
\setlength{\parindent}{0pt}
\setlength{\parskip}{1.8ex}

\head{3390}{Analysis of Algorithms}{30 September 30 1998}{4}

\begin{center}
\Large{\bf Problem of the Week 1}
\end{center}

\bigskip
Design and analyze an efficient algorithm to select a key of a given rank from
a set of $m+n$ keys given in the form of two sorted lists, one of length $m$
and the other of length $n$.  For convenience, you may assume that the $m+n$
keys are all distinct.  ({\em Hint:}\/ A running time of $O(\log\min\{m,n\})$
is achievable.)
\end{document}
