deletions | additions       diff --git a/subsubsection_Backgrounds_for_Individual_Cells__.tex b/subsubsection_Backgrounds_for_Individual_Cells__.tex  index 46a7d3b..ceaa340 100644  --- a/subsubsection_Backgrounds_for_Individual_Cells__.tex  +++ b/subsubsection_Backgrounds_for_Individual_Cells__.tex 
...
\end{lstlisting}  %%%  \definecolor{LightGray}{gray}{0.85} \colorlet{FreshGray}{gray!20!white}  \colorlet{FreshGreen}{green!20!white}  \colorlet{FreshYellow}{yellow!20!white}  \colorlet{FreshRed}{red!20!white}  \def\okcell{\cellcolor{FreshGreen}}  \def\avgcell{\cellcolor{FreshYellow}}  \def\badcell{\cellcolor{FreshRed}}  \def\nocell{\cellcolor{FreshGray}}  \newcolumntype{g}{>{\columncolor{LightGray}}c} \newcolumntype{g}{>{\columncolor{FreshGray}}c}  \begin{tabular}{ |g|c|c|c|c| }  \hline  \multicolumn{5}{|c|}{Comparison of Sorting Algorithms} \\ 
...
\okcell \multirow{2}{*}{Name} & \multicolumn{3}{|c|}{Performance} & \multirow{2}{*}{Memory} \\ \cline{2-4}  & Best & Average & Worst & \\   \hline  Quicksort & \okcell $n \log(n)$ & \okcell $n \log(n)$ & \badcell $n^2$ & \avgcell  $\log n$ \\ Merge Sort & \okcell $n \log(n)$ & \okcell $n \log(n)$ & \okcell $n \log(n)$ & \badcell $n$ worst case\\  In-place merge Sort & \nocell  -- & \nocell  -- & \avgcell $n \log^2(n)$ & \okcell 1 \\ \hline  \end{tabular}  Source for the tabular data: \url{http://en.wikipedia.org/wiki/Sorting_algorithm}