[AD] Update summary to new version of helpers

semester1/algorithms-and-datastructures/parts/search/quick-sort.tex

@@ -9,11 +9,11 @@
         \item \textbf{Efficiency:} Performs well on average and for in-place sorting but can degrade on specific inputs.
         \item \textbf{Time Complexity:}
               \begin{itemize}
-                  \item Best case: \tcl{n \log n}
-                  \item Worst case: \tco{n^2} (when the pivot is poorly chosen)
-                  \item Average case: \tct{n \log n}
+                  \item Best case: $\tcl{n \log n}$
+                  \item Worst case: $\tco{n^2}$ (when the pivot is poorly chosen)
+                  \item Average case: $\tct{n \log n}$
               \end{itemize}
-        \item \textbf{Space Complexity:} In-place sorting typically requires \tct{\log n} additional space for recursion.
+        \item \textbf{Space Complexity:} In-place sorting typically requires $\tct{\log n}$ additional space for recursion.
         \item \textbf{Limitations:} Performance depends heavily on pivot selection.
     \end{itemize}
 \end{properties}