aboutsummaryrefslogtreecommitdiff
path: root/contrib/articles/spending.txt
diff options
context:
space:
mode:
Diffstat (limited to 'contrib/articles/spending.txt')
-rw-r--r--contrib/articles/spending.txt2
1 files changed, 1 insertions, 1 deletions
diff --git a/contrib/articles/spending.txt b/contrib/articles/spending.txt
index 7f2c716f8..887a80910 100644
--- a/contrib/articles/spending.txt
+++ b/contrib/articles/spending.txt
@@ -45,7 +45,7 @@ If the above parameters have an optimal assignment, then replacing
v'[x] := 0
gives another optimal solution, as otherwise we'd get a better one for the first situation.
-There is however no assurence that t[x] = price mod v[x] for some x in D, so nievely such solutions give you running times like O(price * |D|), which kinda sucks actually. Just one simplified example :
+There is however no assurence that t[x] = price mod v[x] for some x in D, so naively such solutions give you running times like O(price * |D|), which kinda sucks actually. Just one simplified example :
http://www.codeproject.com/Articles/31002/Coin-Change-Problem-Using-Dynamic-Programming