Wednesday, September 22, 2010
Joseph problem
There are n persons numbered from 0 to n - 1 standing in a circle. The person number k, counting from the person number 0, is executed. After that the person number k of the remaining persons is executed, counting from the person after the last executed one. The process continues until only one person is left. This person is a survivor. The problem is, given n and k detect the survivor's number in the original circle.
Subscribe to:
Post Comments (Atom)
r := 0;
ReplyDeletefor i from 1 to n do
r := r + (k mod i);
return r;