Welcome to the Josephus Problem page! Here, you'll find a description of the project as well as a list of sample programs written in various languages.
This article was written by:
There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom. Given the total number of persons n and a number k which indicates that k-1 persons are skipped and kth person is killed in circle. The task is to choose the place in the initial circle so that you are the last one remaining and so survive.
n = 5 (total number of people in circle)
k = 2 (number of people - 1 are skipped and kth person is killed)
Output: (Number of people in the circle currently, number of people to skip, index of the person to be killed or removed)
[1, 2, 3, 4, 5] 1 0
[1, 3, 4, 5] 1 1
[1, 3, 5] 1 2
[3, 5] 1 0
At the end, 3rd person stays alive.
Create a file called "Josephus problem" using the naming convention appropriate for your language of choice.
Write a sample program which accepts an integer n (total number of people in the circle) and k (k-1 number of people to be skipped to kill next person) and provide the output integer of the last person alive.
Every project in the Sample Programs repo should be tested. In this section, we specify the set of tests specific to Josephus Problem. In order to keep things simple, we split up the testing as follows:
|Description||Input (n)||Input (k)||Output|
|Sample Input 5, 2||"5"||"2"||"3"|
|Sample Input 7 3||"7"||"3"||"4"|
|Sample Input 41 4||"41"||"4"||"11"|
|Invalid Input: Not A Number||"a"|
|Invalid Input: No K||"1"|
All of these tests should output the following:
Usage: please input the total number of people and number of people to skip.