Timeline for A recursive algorithm to find the number of distinct quantities of money from a pile of coins
Current License: CC BY-SA 4.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 14, 2018 at 13:41 | vote | accept | Bo Work | ||
Dec 14, 2018 at 13:10 | comment | added | Bo Work | The type of problem solving where you accumulate answers from before is new to me. Is that dynamic programming or what is it called? That's a really cool way to solve this problem | |
Dec 14, 2018 at 13:01 | vote | accept | Bo Work | ||
Dec 14, 2018 at 13:03 | |||||
Dec 14, 2018 at 1:42 | history | edited | Errorsatz | CC BY-SA 4.0 |
added 754 characters in body
|
Dec 14, 2018 at 1:26 | history | edited | Errorsatz | CC BY-SA 4.0 |
Fix for when quantity[0] == 0
|
Dec 14, 2018 at 1:20 | history | answered | Errorsatz | CC BY-SA 4.0 |