C Programming Code Examples

C > Linked Lists Code Examples

C Program to Solve Josephus Problem using Linked List

C Program to Solve Josephus Problem using Linked List

This C Program Solves the Josephus Problem using Linked List. Josephus Problem talks about a problem where there are people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed people are removed), until only the last person remains, who is given freedom.

    #include <stdio.h>

    #include <stdlib.h>

    struct node

    {

        int number;

        struct node *next;

    };

    void create(struct node **);

    void display(struct node *);

    int survivor(struct node **, int);

    int main()

    {

        struct node *head = NULL;

        int survive, skip;

        create(&head);

        printf("The persons in circular list are:\n");

        display(head);

        printf("Enter the number of persons to be skipped: ");

        scanf("%d", &skip);

        survive = survivor(&head, skip);

        printf("The person to survive is : %d\n", survive);

        free(head);

        return 0;

    }

    int survivor(struct node **head, int k)

    {

        struct node *p, *q;

        int i;

        q = p = *head;

        while (p->next != p)

        {

            for (i = 0; i < k - 1; i++)

            {

                q = p;

                p = p->next;

            }

            q->next = p->next;

            printf("%d has been killed.\n", p->number);

            free(p);

            p = q->next;

        }

        *head = p;

        return (p->number);

    }

    void create (struct node **head)

    {

        struct node *temp, *rear;

        int a, ch;

        do

        {

            printf("Enter a number: ");

            scanf("%d", &a);

            temp = (struct node *)malloc(sizeof(struct node));

            temp->number = a;

            temp->next = NULL;

            if (*head == NULL)

            {

                *head = temp;

            }

            else

            {

                rear->next = temp;

            }

            rear = temp;

            printf("Do you want to add a number [1/0]? ");

            scanf("%d", &ch);

        } while (ch != 0);

        rear->next = *head;

    }

    void display(struct node *head)

    {

        struct node *temp;

        temp = head;

        printf("%d   ", temp->number);

        temp = temp->next;

        while (head != temp)

        {

            printf("%d   ", temp->number);

            temp = temp->next;

        }

        printf("\n");

    }