[AD] Fixes #2

semester1/algorithms-and-datastructures/parts/search/comparison-based-sort.tex

@@ -70,7 +70,7 @@ The concept for this algorithm is selecting an element (that being the largest o
         \item \textbf{Efficiency:} Works well for small datasets or nearly sorted arrays.
         \item \textbf{Time Complexity:}
               \begin{itemize}
-                  \item Best case (already sorted): $\tcl{n\log(n)}$
+                  \item Best case (already sorted): $\tcl{n}$
                   \item Worst case (reversed order): $\tco{n^2}$
                   \item Average case: $\tct{n^2}$
               \end{itemize}