PHP solution Joseph Ring Example _php tutorial

The question of Joseph (sometimes also called Josephus permutation) is a problem that appears in computer science and mathematics. In computer programming algorithms, a similar problem is called Joseph Ring. Also known as "drop handkerchief problem".)

A group of monkeys, all with numbers, stood a lap, count to M of the shot, the rest of the number. So the rest of the dead is crazy.

Copy the Code code as follows:
function Killmonkeys ($monkeys, $m) {
$k = $m;
while (count ($monkeys)) {
$k = $k-1;
$monkey = Array_shift ($monkeys);
if ($k) {
$monkeys [] = $monkey;
} else {
echo "". $monkey. "Monkey, Shoot!"
";
$k = $m;
}

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

http://www.bkjia.com/PHPjc/751512.html www.bkjia.com true http://www.bkjia.com/PHPjc/751512.html techarticle The question of Joseph (sometimes also called Josephus permutation) is a problem that appears in computer science and mathematics. In computer programming algorithms, a similar problem is called Joseph Ring. and .....

