Talk:Sum to 100: Difference between revisions
→extra credit: N largest sums doesn't seem to much affect the run-time, at least in the case of Haskell
(→complete list of the number of solutions for zero ──► 300: added a new talk section.) |
(→extra credit: N largest sums doesn't seem to much affect the run-time, at least in the case of Haskell) |
||
Line 25:
== extra credit ==
I had initially thought to add an extra credit solution for the ''largest'' sum (except for the obvious '''123456789'''). I'm not sure it would be a worthwhile (optional) requirement, it could be pretty CPU intensive. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 04:21, 1 January 2017 (UTC)
: Seems fine as an additional task – I've just added it for Haskell and it doesn't seem to noticeably increase the interpreter run-time. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 00:29, 5 January 2017 (UTC)
==complete list of solutions for '''9'''==
|