Skip to content

Update josephus_improved.py #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jun 7, 2019
Merged

Update josephus_improved.py #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 5 additions & 1 deletion josephus_improved.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,11 @@ def josephus_v2(people, step=2):
# the loop runs for O(floor(logN)) time
while p*2 < N:
p = p*2
print((2*(N-p))+1)
# If N is a power of 2, should return 1. So let's check if L (N-p) is < p
if N-p >= p:
print(1)
else:
print((2*(N-p))+1)

num = int(input("Enter the number of soldiers: "))
soldiers = [i for i in range(1, num+1)] # generates a list of 1..num
Expand Down