
\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SortedList$<$Item$>$  & l;
\end{tabular}\\
 
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Construct a singly-linked sorted list $l$.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SortedList$<$Item$>$  & l2(l);
\end{tabular}\\
 
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Construct a singly-linked list $l2$ and 
			initialize it with the elements of $l$ such that the 
			elements of the new list are in lexicographic order.
			If $l$ is an instance of a container other than a 
			\SortedList,\ then a sorted insertion routine must
			be used to load the elements, leading to $O(n^2)$ 
			time.  If $l$ is a \SortedList,\ then elements are
			appended to the end of $l2$, yielding $O(n)$ time.\end{minipage}
\end{minipage}
\vspace{0.2in}

