\documentclass[11pt]{article}

\setlength{\topmargin}{-.8in}  
\setlength{\oddsidemargin}{0in}
\setlength{\evensidemargin}{0in}
\setlength{\textwidth}{6.5in}
\setlength{\textheight}{9.5in}


\begin{document}

\title{Class work: Linear time sorting}

\date{}
\maketitle

\begin{enumerate}

\item [8.1-1] What is the smallest possible depth of a leaf in a
  decision tree for a comparison sort of $n$ elements?

\item [8.2-2] Argue that  Counting-sort is stable.

\item [8.2-3] Suppose that we were to rewrite the last for loop in
  Counting-sort as: for j=1 to A.length (instead of: for j=A.length
  down to 1). Would the algorithm work (i.e. sort properly)?  What
  would change?

\item [8.3-1] Illustrate the operation of Radix-sort on the following
  list of English words:  COW, DOG, SEA, RUG, ROW, MOB, BOX, TAB, BAR,
  EAR, TAR, DIG, TEA, NOW, FOX.


%\item [8.4-1] Illustrate the operation of Bucket-sort on the array
%  A=[.79, .13, .16, .64, .39, .20, .89, .53, .71, .42].



\end{enumerate}



\end{document}
%%% Local Variables: 
%%% mode: latex
%%% TeX-master: t
%%% End: 
