Anonymous user
Talk:Best shuffle: Difference between revisions
→Task Description
(→Task Description: suggested task description change) |
|||
Line 14:
::: I think that's a good idea. Having more than one approach is more interesting anyway. English is not my native language. Maybe somebody could adjust the task description. I don't want to risk creating more confusion :) [[User:Fwend|Fwend]] 14:24, 15 May 2011 (UTC)
::::Okay, how about something like this "Shuffle the characters of a string in such a way that as many of the character values are in a different position as possible. Print the result as follows: original string, shuffled string, (score). \n\nWhere the score the number of characters that remain in their original position. The better the shuffle the smaller the score. \n\nAs there are often multiple solutions that achieve the lowest score, for extra points include or show how to achieve randomization amongst these lowest scoring results." --[[User:Dgamey|Dgamey]] 03:12, 16 May 2011 (UTC)
::::: How about: "Shuffle the characters of a string in such a way that as many of the character values are in a different position as possible. Print the result as follows: original string, shuffled string, (score). \n\n. The score gives the number of positions whose character value did not change. A shuffle that produces a randomized result is to be preferred. A deterministic approach that produces the same sequence every time is acceptable as an alternative." [[User:Fwend|Fwend]] 20:13, 16 May 2011 (UTC)
== J implementation notes ==
| |||