search

jainaman224 / Algo_Ds_Notes

A comprehensive resource for learning and implementing algorithms and data structures. This repository includes detailed notes, complexity analysis, and code examples in C++, Java, Python, and more. Ideal for students, professionals, and those preparing for coding interviews.
GNU General Public License v3.0
2.23k stars 2.08k forks source link

Josephus Problem #461

Closed tusharsabhani closed 5 years ago

tusharsabhani commented 5 years ago

In this problem n people are standing in a circle and n-1 are executed. In each step a certain number of people are skipped and the next person in the circle is executed. This certain number is denoted by k, so after every execution k-1 people are skipped and the next person is executed. By Josephus method we need to find the place where the person will not be executed.

DeepankarAcharyya commented 5 years ago

@tusharsabhani I am a GsSoc participant and would like to work on it.

tusharsabhani commented 5 years ago

I already did for C & C++

DeepankarAcharyya commented 5 years ago

I have done the program for python3

jainaman224 commented 5 years ago

Great. @DeepankarAcharyya Please claim issue first from next time.