this is for holding javascript data
Dat Do edited beginproblem_a_You_a.tex
about 10 years ago
Commit id: 07a4d490aeed6ef73870ce7836b7b2f5a3c97ba7
deletions | additions
diff --git a/beginproblem_a_You_a.tex b/beginproblem_a_You_a.tex
index 41da0c5..292de2f 100644
--- a/beginproblem_a_You_a.tex
+++ b/beginproblem_a_You_a.tex
...
(d) First, we will find the lower bound for $W(n) = 2^{n+1}-n-2$
\\
$2^{n+1}-n \geq 2^n - \frac{2^n}{2}$ which is true for $n > 2$
\\Since $\frac{2^n}{2}$ belongs to $\BigO(2^n), W(n) must as well since it is less than \frac{2^n}{2}$
\\*