Small fix
This commit is contained in:
parent
689af92407
commit
cdfae6862e
|
@ -102,7 +102,7 @@ if the coins are $\{1,3,4\}$ and the target sum
|
|||
is 6, the greedy algorithm produces the solution
|
||||
$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.
|
||||
However, as we will see in Chapter 7,
|
||||
the general problem can be efficiently
|
||||
|
|
Loading…
Reference in New Issue