The Josephus problem is the following game: N people, numbered 1 to N, are sitti

Question

The Josephus problem is the following game: N people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After M passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. Thus, if M = 0 and N = 5, players are eliminated in order , and player 5 wins. If M = 1 and N = 5, the order of elimination is 2, 4, 1, 5.

c. If M = 1, what is the running time of your program? How is the actual speed affected by the delete routine for large values of N (N > 100,000)?

Note: This is C++.

Explanation / Answer

if (M=1) running time = O(N) so if N is large complexity will be large

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.