Anonymous user
Talk:Sailors, coconuts and a monkey problem: Difference between revisions
Talk:Sailors, coconuts and a monkey problem (view source)
Revision as of 22:03, 26 June 2021
, 2 years agoforced a TOC (for now).
m (forced a TOC (for now).) |
|||
Line 1:
__TOC__
== J ==
I smiled at that end comment, but there may be an issue with the choice of an end value to search over. It seems that unlike testing incrementing values you have to put a ceiling on the range searched for.
Line 6 ⟶ 9:
I do have to put in a ceiling - that gives me bound search time and protects me from "infinite loop" bugs while I'm playing with the code. But if a given value doesn't give me good results, it's trivial for me to multiply it by 10 and try again. I guess what I'm saying is that for this problem, this approach saved time for me. (But I guess you basically said this already, in your second paragraph.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 11:55, 3 May 2015 (UTC)
== Analysis ==
Line 90 ⟶ 94:
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 09:44, 5 May 2015 (UTC)
==Haskell version==
| |||