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

Function -> code

This commit is contained in:
Antti H S Laaksonen 2017-02-17 00:53:57 +02:00
parent 11f763d24c
commit 2af09e463c
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
luku10.tex
View File

@ -538,7 +538,7 @@ for (int k = 0; k < n; k++) {
}
\end{lstlisting}
The above code is based on the recursive definition
of $c$. As a special trick, the function only uses
of $c$. As a special trick, the code only uses
the array $d$ to calculate all values of the function.
Finally, for each set $x$ in $C$, $f(x)=d[x]$.