\documentclass[11pt]{article}
\usepackage{handout2e}
\begin{document}
\input{macros}
\input{courseMacros}
\thispagestyle{empty}
\setlength{\parindent}{0pt}
\setlength{\parskip}{1.8ex}

\head{CSU690}{Algorithms and Data}{Fall 2006}{22 September 2006}{6}

\begin{center}
\Large{\bf Review 2 (Tuesday, September 26)}
\end{center}

{\bf 1.} We will discuss parts of Problem Set 1 about which students
had most concerns.

{\bf 2.}  Chapter 5, Exercise 1, page 246.

{\bf 3.}  Suppose you would like to merge $k$ sorted lists, each of
length $n$, into one sorted list of length $nk$.  
\begin{itemize}
\item
One strategy is to use the merge operation we studied in class to
merge the first two arrays, then merge in the third, then merge in the
fourth, and so on.  What is the time complexity of this algorithm, in
terms of $n$ and $k$?

\item
Give a more efficient solution to this problem, using divide and
conquer.
\end{itemize}

\end{document}