Anonymous user
Talk:Perfect shuffle: Difference between revisions
→Hostile task requirement?: Vote!
m (→Hostile task requirement?: added a reply.) |
(→Hostile task requirement?: Vote!) |
||
Line 27:
:: Well... I've documented the algorithm I'm using in the J entry, and... 16384 has a cycle length of 14, which takes less than a millisecond for me to compute (though in general the cycle length for this task for a sequence of unique values of length 2^N should be N). So even if you brute force it, that form of the task shouldn't take that long. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 22:40, 15 June 2015 (UTC)
:::'''Who would object''' to my suggested change and why? I did not start the draft task or do a language implementation but the task as written could be improved by defining drastically shorter output requirements. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 00:01, 16 June 2015 (UTC)
| |||