This program solves the Josephus Problem using a circular Queue in C++ and visualizes it with SFML. Participants are sequentially eliminated every K-th position until only one survivor remains, displayed with graphical updates and sound effects. The program provides an interactive view of the elimination process and the final winner.

This program calculates the surviving position in the Josephus problem with two ways.

Collection of C++ programs showcasing diverse functionalities and mathematical concepts. Includes the Josephus problem simulation, Maclaurin series for sine calculation, Pascal's Triangle generator, and a prime numbers spiral checker.

In this Repository is the code to all the Recursions Questions Explained by Aditya Verma in his Recursion playlist

Second Project for Advanced Data Structures (WSU). This application tests the speed of a linked list and vector given small and large elements

This is a test prgram tha implements Joseph's problem by usin queu data structure

C++ code to implement a global function of Josephus circle problem

My attempt for Data Structures Lab Assignments at IIT Guwahati . All assignments done in C++ language

In this mini project basic concepts of Data Structure are bound together in one main program

Josephus math problem solver written in C++