- Self-developed solution for the classic josephus problem(step = 2).
- The implementation follows an iterative solution.
- input : initial number of people.
- output : index of the surviving person.
- Time complexity : O(log(n)).
-
Notifications
You must be signed in to change notification settings - Fork 0
Kallachi10/josephus-problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An efficient solution to the classic josephus problem ( step = 2 )
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published