n), starting point (i), direction (clockwise/anti-clockwise) and number to be skipped (k). Your program then must populate a circular linked list with n nodes where data of each node should be their position in the circle (starting from 1). Your program should then work iteratively pri
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Your task is to develop a circular linked-list based simulation of the Josephus problem. The
simulation will be text based. The user should be presented with a text-based menu asking him to
enter the total number of people (n), starting point (i), direction (clockwise/anti-clockwise) and
number to be skipped (k). Your
where data of each node should be their position in the circle (starting from 1).
Your program should then work iteratively printing the remaining persons after each iteration
(round of killing). After the last iteration only the node with the winning initial position should be
left in the list.
Step by step
Solved in 2 steps
