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

Small fix

This commit is contained in:
Antti H S Laaksonen 2017-02-21 20:13:04 +02:00
parent 689af92407
commit cdfae6862e
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
luku06.tex
View File

@ -102,7 +102,7 @@ if the coins are $\{1,3,4\}$ and the target sum
is 6, the greedy algorithm produces the solution is 6, the greedy algorithm produces the solution
$4+1+1$ while the optimal solution is $3+3$. $4+1+1$ while the optimal solution is $3+3$.
We do not know if the general coin problem It is not known if the general coin problem
can be solved using any greedy algorithm. can be solved using any greedy algorithm.
However, as we will see in Chapter 7, However, as we will see in Chapter 7,
the general problem can be efficiently the general problem can be efficiently