diff options
author | Sebastian <sebasjm@gmail.com> | 2023-09-10 15:38:43 -0300 |
---|---|---|
committer | Sebastian <sebasjm@gmail.com> | 2023-09-10 15:38:43 -0300 |
commit | 905be0124a1b013d802db33265879d4b80501362 (patch) | |
tree | 69e5a088d76205bd2e3a1022c71e02eb3101c5a1 /contrib/articles/spending.txt | |
parent | 6c3cfa9be7a332c2cc8490f25ebd6c73c8244842 (diff) | |
download | wallet-core-905be0124a1b013d802db33265879d4b80501362.tar.xz |
more codespellv0.9.3-dev.20
Diffstat (limited to 'contrib/articles/spending.txt')
-rw-r--r-- | contrib/articles/spending.txt | 2 |
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 |