From cdfae6862ef2074cfce69a1760165f8e8fb6fd47 Mon Sep 17 00:00:00 2001 From: Antti H S Laaksonen Date: Tue, 21 Feb 2017 20:13:04 +0200 Subject: [PATCH] Small fix --- luku06.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/luku06.tex b/luku06.tex index 6ee8f82..e4cb004 100644 --- a/luku06.tex +++ b/luku06.tex @@ -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