this is for holding javascript data
Deyan Ginev edited subsection_Advanced_Table_Colors_In__.tex
almost 9 years ago
Commit id: 0037ed81fa82d6a098ed8c2e8fd35859d7b0886c
deletions | additions
diff --git a/subsection_Advanced_Table_Colors_In__.tex b/subsection_Advanced_Table_Colors_In__.tex
index 1f83d44..f04f6ea 100644
--- a/subsection_Advanced_Table_Colors_In__.tex
+++ b/subsection_Advanced_Table_Colors_In__.tex
...
\multicolumn{5}{|c|}{Comparison of Sorting Algorithms} \\
\hline
\multirow{2}{*}{Name} & \multicolumn{3}{|c|}{Performance} & \multirow{2}{*}{Memory} \\
& Best & Average & Worst &
\cline{2-5} \\
\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\\
...
\multicolumn{5}{|c|}{Comparison of Sorting Algorithms} \\
\hline
Name & \multicolumn{3}{|c|}{Performance} & Memory \\ \\
& 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\\