Question - 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 survivo…

Josephus Problem.cpp

Iterative version 

int jos(int K,int N)
{
        int r =0;
        for(int i=1;i<=N;i++)
       {
             r = r + K%i;
        }
    return r;
       
}
Recursive version 
int josephus(int n, int k)
{
  if (n == 1)
    return 1;
  else
    /* The position returned by josephus(n - 1, k) is adjusted because the
       recursive call josephus(n - 1, k) considers the original position
       k%n + 1 as position 1 */
    return (josephus(n - 1, k) + k-1) % n + 1;

}