this is for holding javascript data
Jeremy Ting edited untitled.tex
about 10 years ago
Commit id: fa8ed00f4a9efe0338067ae8011920d7ce7aba54
deletions | additions
diff --git a/untitled.tex b/untitled.tex
index a9b11d3..8c5be6c 100644
--- a/untitled.tex
+++ b/untitled.tex
...
We can use Case 3 that was given ($f(n) = \Omega(n^{log_{b}a+\epsilon})$ ) to analyze the recurrence relation.
$f(n)= n!$ and $n^{log_{b}a+\epsilon}$ for $\epsilon > 0$
\end{enumerate}