Solution Of Josephus Problem Using Recursion | FREE DSA Course in JAVA | Lecture 37

Video Description

Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - https://youtube.com/playlist?list=PLU83Ru7iGtAvP1rqt65MCDSBPFCzUKGXG a We are up with the lecture 37 of our much awaited dsa course in java. In the recursion module of our free dsa course, we have been solving a lot of question recursively which can be solved using the normal approach. This is done to make your understand the concept and help you write the program recursively. Today we will be solving a very special question named as Josephus problem The concept of the question marks it's original in the first century. The background of the question lies in the roman empire where they were a very dominating & strong empire. The Roman army used to kill in a very strategic way. They used to make people stand in a circle and asked them to kill each other until one person is remaining in a way that every third person dies. Once a Jewish mathematician Josephus also caught by the Romans along with other Jewish army people. Being a smart mathematician, Josephus devised a way to actually find the position of the person who will remain alive after the death game. You can discover more about the problem on Google. In this lecture we will find the solution to the problem that if n persons are standing and in a circle and kth person will die, then who will remain alive. We bet you'll not find a better solution to this program in the world. Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course. For more information, fill this form: https://forms.gle/8eiUmM92Fx563Aen9 or call us at 8884881203 Facebook: https://www.facebook.com/thetapacademy Instagram:https://www.instagram.com/tapacademy_online Linkedin: https://www.linkedin.com/company/73820805 Website: https://www.thetapacademy.com​ #dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder #bitmanipulation