Anonymous user
Talk:Topswops: Difference between revisions
m
→Speed?: added a comment about the limit.
(+Alternate J solution) |
m (→Speed?: added a comment about the limit.) |
||
Line 2:
Should I change the limits and ask for an output table for n in 1..8 instead? The idea is not to solicit heavily speed optimised solutions but to show an accurate solution in idiomatic code. --[[User:Paddy3118|Paddy3118]] 22:48, 22 November 2012 (UTC)
:I would be surprised if there was not a better algorithm than the straightforward translation of the rounding process. So I think it's fine to let n from 1 to 10 in order to give an incentive to find a good algorithm.--[[User:Grondilu|Grondilu]] 23:16, 22 November 2012 (UTC)
::With a limit that is greater than nine, (at least for the approach that I used in REXX), I needed to use a different algorithm (with a two digit decimal number). So, I think that a limit of ten is warranted, although speed was an issue for me for testing. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 01:12, 16 June 2017 (UTC)
== Repitition? ==
| |||