Php solution Joseph's ring example _ PHP Tutorial-php Tutorial

Php solves the Joseph ring example. Joseph's problem (also known as Joseph's replacement) is a problem that occurs in computer science and mathematics. In computer programming algorithms, a similar problem is also called Joseph's ring. Joseph's problem (also known as Joseph's replacement) is a problem that occurs in computer science and mathematics. In computer programming algorithms, a similar problem is also called Joseph's ring. It is also known as the "handkerchief problem ".)

A group of monkeys all carry numbers. they stood around and shot at m, and the rest went on. In this way, the other one is crazy.

The code is 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!
";
$ K = $ m;
}

}
Echo $ monkey. "monkey Sparta ";
}
$ Monkeys = range (0, 25 );
Unset ($ monkeys ['0']);
$ M = 5;
KillMonkeys ($ monkeys, $ m );

(Also known as Joseph's replacement) is a problem that occurs in computer science and mathematics. In computer programming algorithms, a similar problem is also called Joseph's ring. And...