this is for holding javascript data
Deyan Ginev edited subsection_Advanced_Table_Colors_In__.tex
almost 9 years ago
Commit id: 3001d266efd2911ef3bbfbeb61541dee8e266c34
deletions | additions
diff --git a/subsection_Advanced_Table_Colors_In__.tex b/subsection_Advanced_Table_Colors_In__.tex
index f04f6ea..df1a816 100644
--- a/subsection_Advanced_Table_Colors_In__.tex
+++ b/subsection_Advanced_Table_Colors_In__.tex
...
\hline
\multicolumn{5}{|c|}{Comparison of Sorting Algorithms} \\
\hline
\multirow{2}{*}{Name} & \multicolumn{3}{|c|}{Performance} & \multirow{2}{*}{Memory} \\
\cline{2-4}
& Best & Average & Worst & \\
\cline{2-4}
\hline
Quicksort & $n \log(n)$ & $n \log(n)$ & $n^2$ & $\log n$ \\
Merge Sort & $n \log(n)$ & $n \log(n)$ & $n \log(n)$ $n$ worst case\\
...
\hline
\multicolumn{5}{|c|}{Comparison of Sorting Algorithms} \\
\hline
Name & \multicolumn{3}{|c|}{Performance} & Memory \\
\\ \cline{2-4}
& Best & Average & Worst & \\
\cline{2-4}
\hline
Quicksort & $n \log(n)$ & $n \log(n)$ & $n^2$ & $\log n$ \\
Merge Sort & $n \log(n)$ & $n \log(n)$ & $n \log(n)$ & $n$ worst case\\