Talk:Perfect shuffle: Difference between revisions
→Hostile task requirement?
(→Hostile task requirement?: added more comments.) |
|||
Line 21:
:Although I haven't run any code to see if the 16384 calculation is reasonable, time-wise.
:--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 22:33, 15 June 2015 (UTC)
:: 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)
| |||