Best shuffle: Difference between revisions
Content added Content deleted
Line 2,275: | Line 2,275: | ||
s2$ = s1$ |
s2$ = s1$ |
||
for i = 1 to len(s2$) |
for i = 1 to len(s2$) |
||
if mid$(s2$,i,1) = mid$(s1$,i,1) then |
|||
for j = 1 to len(s2$) |
for j = 1 to len(s2$) |
||
if (i <> j) and (mid$(s2$,i,1) <> mid$(s1$,j,1)) and (mid$(s2$,j,1) <> mid$(s1$,i,1)) then |
if (i <> j) and (mid$(s2$,i,1) <> mid$(s1$,j,1)) and (mid$(s2$,j,1) <> mid$(s1$,i,1)) then |
||
Line 2,282: | Line 2,281: | ||
end if |
end if |
||
next j |
next j |
||
end if |
|||
next i |
next i |
||
bestShuffle$ = s2$ |
bestShuffle$ = s2$ |