Find the missing permutation: Difference between revisions
m
→{{header|Phix}}: explained smallest(count,1)
m (→{{header|Phix}}: added a bit more explanation) |
m (→{{header|Phix}}: explained smallest(count,1)) |
||
Line 1,516:
puts(1,r&'\n')
-- (relies on the assumption that a full set would have each letter occurring the same number of times in each position)
-- (smallest(count,1) returns the index position of the smallest, rather than it's value)
-- 4: test all permutations
| |||