Best shuffle: Difference between revisions
Content added Content deleted
m (output added) |
m (and a deterministic result) |
||
Line 2,128: | Line 2,128: | ||
<lang Phix>constant tests = {"abracadabra", "seesaw", "elk", "grrrrrr", "up", "a"} |
<lang Phix>constant tests = {"abracadabra", "seesaw", "elk", "grrrrrr", "up", "a"} |
||
string s,t |
string s,t |
||
integer c |
|||
for test=1 to length(tests) do |
for test=1 to length(tests) do |
||
s = tests[test] |
s = tests[test] |
||
Line 2,140: | Line 2,139: | ||
end for |
end for |
||
end for |
end for |
||
⚫ | |||
c = 0 |
|||
for i=1 to length(t) do |
|||
if t[i]==s[i] then c += 1 end if |
|||
end for |
|||
⚫ | |||
end for</lang> |
end for</lang> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |
||
abracadabra -> |
abracadabra -> baacabrdaar (0) |
||
seesaw -> aswees (0) |
seesaw -> aswees (0) |
||
elk -> lke (0) |
|||
grrrrrr -> rrrgrrr (5) |
|||
up -> pu (0) |
|||
a -> a (1) |
|||
</pre> |
|||
By replacing <code>t=shuffle(s)</code> with <code>t=s</code>, the following deterministic result is output every time: |
|||
<pre> |
|||
abracadabra -> raaracababd (0) |
|||
seesaw -> wasese (0) |
|||
elk -> lke (0) |
elk -> lke (0) |
||
grrrrrr -> rgrrrrr (5) |
grrrrrr -> rgrrrrr (5) |