Josephus problem: Difference between revisions
m
→{{header|Phix}}: removed Quackery from unclassified
m (→sliding queue: added Quackery) |
m (→{{header|Phix}}: removed Quackery from unclassified) |
||
Line 2,842:
=={{header|Phix}}==
I managed to identify eight algorihms in use on this page, so I translated all of them. Kill ordering lists omitted for sanity.<br>
Unclassified: Haskell, Python[4 aka learning iter in python], REXX[version 2] (plus Befunge, J
Note all indexes and results are 1-based. For skipping/linked_list/sliding_queue, prisoners do not have to be numbers, the
same would be true for contractacycle and contractalot with the tiniest of tweaks. For recursive/iterative, prisoners are implicitly numbers, not that it would be difficult to use the result(s) to subscript a list of string names.
| |||