PHP solution Joseph Ring Example _php instance

The question of Joseph (sometimes referred to as Josephus substitution) is a problem that arises in computer science and mathematics. In computer programming algorithms, similar problems are called Joseph Rings. Also called "The problem of the handkerchief lost."

Monkeys a group, all with the number, stood a circle, count to M of the shot, the rest of the next number. The rest of the dead is gone.

Copy Code code as follows:

<?php
function Killmonkeys ($monkeys, $m) {
$k = $m;
while (count ($monkeys)) {
$k = $k-1;
$monkey = Array_shift ($monkeys);
if ($k) {
$monkeys [] = $monkey;
} else {
echo "<font color= ' Red ' >". $monkey. "The </font> monkey is dead!" <br/> ";
$k = $m;
}

}
Echo $monkey. "Number Monkey Spartan";
}
$monkeys = Range (0, 25);
unset ($monkeys [' 0 ']);
$m = 5;
Killmonkeys ($monkeys, $m);