this is for holding javascript data
Dat Do edited beginproblem_a_You_a.tex
about 10 years ago
Commit id: 7b7022b6f6f7be74e733fedd34f9ca02d9571f7c
deletions | additions
diff --git a/beginproblem_a_You_a.tex b/beginproblem_a_You_a.tex
index 8182966..7f2a02b 100644
--- a/beginproblem_a_You_a.tex
+++ b/beginproblem_a_You_a.tex
...
\\\\
Now we will find the upper bound for $W(n) = 2^{n+1}-n-2$
\\\\
Since $2^{n}-n \leq 2^n$, $W(n)$ belongs to $\textit{O}(2^n)$
\\*
\begin{problem}