Question

Usin java ,

Assume N people have decided to elect a leader by arranging themselves in a circle and eliminating every Mth person around the circle, closing ranks as each person drops out. Find which person will be the last one remaining (with rank 1).

HINT: Assume the input is a circular linked list with N nodes and each node has a number (range 1 to N) associated with it. The head node has number 1 as data.

Answer 1

class leader {
public static int find(int n, int m)
{
if (n == 1)
return 1;
else
return (find(n - 1, m) + m-1) % n + 1;
}
public static void main(String[] args)
{
int n,m;
n= 9;
m = 5;
System.out.println( find(n, m));
}
}
  

*****************************************************************************
PLEASE DO UPVOTE IF THE ANSWER IS HELPFUL AS IT GIVES THE CONFIDENCE TO HELP MORE STUDENTS
*****************************************************************************
Chegg allows me to answer specific no of questions including the sub parts , so please do post the rest of the questions as a separate query as per Chegg Guidelines. Thank you :)
*****************************************************************************