Anonymous user
Talk:Perfect shuffle: Difference between revisions
m
→Hostile task requirement?: added a reply.
m (→Hostile task requirement?: added a reply.) |
|||
Line 18:
:::::: As I tried to state in my original paragraph - putting all those numbers on a single line crashes the wiki implementation. (Not permanently, but you can't save an edit which has the full result on a single line.) But ... are you saying that you didn't read that original paragraph nor the task description? --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 22:43, 15 June 2015 (UTC)
::::::: No, I'm not saying (or implying) that I didn't read about the failure, and I have read the Rosetta Code task's requirements. It says to print (essentially) 5,000 results. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:52, 15 June 2015 (UTC)
:Seems like a flaw to me to. Why not edit the task to ask for shuffle counts for 2^(2*n) for n = 1..7 i.e only for counts: [4, 16, 64, 256, 1024, 4096, 16384]
| |||