Anonymous user
Topswops: Difference between revisions
→{{header|Racket}}
(→{{header|Racket}}: Output?) |
|||
Line 774:
=={{header|Racket}}==
Simple search, only "optimization" is to consider only all-misplaced permutations (as in the alternative Haskell solution), which shaves off around 2 seconds (from ~5).
Line 796:
(for ([i (in-range 1 11)]) (printf "~a\t~a\n" i (topswops i)))
</lang>
Output:
<pre>
1 0
2 1
3 2
4 4
5 7
6 10
7 16
8 22
9 30
10 38
</pre>
=={{header|REXX}}==
| |||