\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SortedArray$<$Item$>$  & a;
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Creates an empty dynamic sorted array.
 A default size of \verb+sizeof(Item)+ * DEFAULT\_SIZE (see general.h) 
 is used. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SortedArray$<$Item$>$  & a( (int) sz);
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Creates an dynamic sorted array with a block of space large enough to store
{\em sz} \verb+Item+s. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SortedArray$<$Item$>$  & a( (SortedArray$<$Item$>$\&) a);
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Creates an dynamic sorted array with a block of space as large as that 
 of $a$ and initializes it with the elements of $a$ such that order is
 preserved.  $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SortedArray$<$Item$>$  & a( (Container$<$Item$>$\&) c);
\end{tabular}\\

 
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Creates an dynamic array with storage of default size and initializes it
 with the elements of $c$.  Note that the elements of $c$ may not be stored
in order, leading to a worst case running time of $O(n^2)$.\end{minipage}
\end{minipage}
\vspace{0.2in}

