bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Clarify number of calls

This commit is contained in:
Antti H S Laaksonen 2017-05-25 16:10:21 +03:00
parent 403f2300c3
commit 5e08fd3ded
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
chapter02.tex
View File

@ -174,10 +174,10 @@ Hence, the call $\texttt{g}(n)$ causes the following calls:
\begin{tabular}{rr}
parameter & number of calls \\
\hline
$\texttt{g}(n)$ & 1 \\
$\texttt{g}(n-1)$ & 2 \\
$n$ & 1 \\
$n-1$ & 2 \\
$\cdots$ & $\cdots$ \\
$\texttt{g}(1)$ & $2^{n-1}$ \\
$1$ & $2^{n-1}$ \\
\end{tabular}
\end{center}
Based on this, the time complexity is