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

Small fixes

This commit is contained in:
Antti H S Laaksonen 2017-04-18 20:15:43 +03:00
parent 8dcb525de9
commit f551b3b422
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
chapter05.tex
View File

@ -510,7 +510,7 @@ the lower-right corner and count the number of such paths.
\item \item
running time: 483 seconds running time: 483 seconds
\item \item
recursive calls: 76 billion number of recursive calls: 76 billion
\end{itemize} \end{itemize}
\subsubsection{Optimization 1} \subsubsection{Optimization 1}
@ -564,7 +564,7 @@ and finally multiply the number of the solutions by two.
\item \item
running time: 244 seconds running time: 244 seconds
\item \item
recursive calls: 38 billion number of recursive calls: 38 billion
\end{itemize} \end{itemize}
\subsubsection{Optimization 2} \subsubsection{Optimization 2}
@ -593,7 +593,7 @@ immediately if we reach the lower-right square too early.
\item \item
running time: 119 seconds running time: 119 seconds
\item \item
recursive calls: 20 billion number of recursive calls: 20 billion
\end{itemize} \end{itemize}
\subsubsection{Optimization 3} \subsubsection{Optimization 3}
@ -625,7 +625,7 @@ It turns out that this optimization is very useful:
\item \item
running time: 1.8 seconds running time: 1.8 seconds
\item \item
recursive calls: 221 million number of recursive calls: 221 million
\end{itemize} \end{itemize}
\subsubsection{Optimization 4} \subsubsection{Optimization 4}
@ -662,7 +662,7 @@ very efficient:
\item \item
running time: 0.6 seconds running time: 0.6 seconds
\item \item
recursive calls: 69 million number of recursive calls: 69 million
\end{itemize} \end{itemize}
~\\ ~\\