From 5e08fd3ded1ab0cd4f5e321f7133064b8b5e0a88 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Thu, 25 May 2017 16:10:21 +0300
Subject: [PATCH] Clarify number of calls

---
 chapter02.tex | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/chapter02.tex b/chapter02.tex
index d058658..f7d3875 100644
--- a/chapter02.tex
+++ b/chapter02.tex
@@ -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