Anonymous user
Best shuffle: Difference between revisions
m
added a ;Task: (bold) header, added other whitespace and highlighting to the task's preamble.
m (→{{header|AWK}}) |
m (added a ;Task: (bold) header, added other whitespace and highlighting to the task's preamble.) |
||
Line 1:
{{task}}
{{task}}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). The score gives the number of positions whose character value did ''not'' change. ▼
;Task:
▲
Print the result as follows: original string, shuffled string, (score).
A shuffle that produces a randomized result among the best choices is to be preferred. A deterministic approach that produces the same sequence every time is acceptable as an alternative.▼
The ''score'' gives the number of positions whose character value did ''not'' change.
;Example:
tree ───► eetr [a ''score'' of '''0''' (zero)]
A shuffle that produces a randomized result among the best choices is to be preferred.
▲
;Test cases:
abracadabra
seesaw
elk
grrrrrr
up
a
;Related tasks
* [[Anagrams/Deranged anagrams]]
* [[Permutations/Derangements]]
<br><br>
| |||