Php Joseph's problem solving: The algorithm for killing prisoners, php Joseph's prisoner algorithm _ PHP Tutorial

Php Joseph's problem solving algorithm for killing prisoners: php Joseph's prisoner algorithm. Php Joseph's problem solving algorithm for killing prisoners. This article describes examples of php Joseph's problem solving algorithm for killing prisoners. I would like to share with you the php Joseph's problem solving algorithm for prisoner killing, and the php Joseph's prisoner algorithm.

This article provides an example of php Joseph's algorithm for solving the problem of prisoner killing. Share it with you for your reference. The specific analysis is as follows:

In ancient times, a judge ordered the death of an IV prisoner. he had a absurd law that made the prisoner stand in a circle, starting from the number of individuals in s, and then pulled out and executed every time the number of persons in D was reached, then count D more and execute again ...... Until the last one can be forgiven.

Function getNum ($ n, $ m) {// used to save all the numbers to the array initialization $ a = array (); // traverses and stores them in the array for ($ I = 1; $ I <= $ n; $ I ++) {$ a [$ I] = $ I;} // the pointer is 0 reset ($ ); while (count ($ a)> 1) {// if the number of items in the array is greater than 1, continue to remove elements in the loop. // The removal rule for ($ j = 1; $ j <= $ m; $ j ++) {// if the last entry of the array is not reached, if (next ($ a) {if ($ j = $ m) {// delete m unset ($ a [array_search (prev ($ a), $ a)]) ;}} else {// If next does not exist, then the pointer is 0 reset ($ a); if ($ j = $ m) {unset ($ a [array_search (end ($ a), $ a)]); reset ($ a) ;}}} return current ($ a) ;}echo getNum (5, 3 );

I hope this article will help you with php programming.

Examples in this article describe the php Joseph's algorithm for solving the issue of prisoner killing. Share it with you for your reference...