QUEUE USING ARRAYS by smd

-

 #include<stdio.h>

#define size 100

int queue[size];

int front = -1, rear = -1;

void enqueue(int x)

 {

    if (rear == size - 1) 

    {

        printf("Queue is overflow\n");

    } else

     {

        if (front == -1)

         {

            front = 0; // Initialize front if queue was empty

        }

        rear++;

        queue[rear] = x;

        printf("%d inserted sucessfully\n", x);

    }

}

void dequeue()

 {

    if (front == -1 || front > rear) 

    {

        printf("Queue is underflow\n");

    } else 

    {

        printf("%d deleted successfully\n", queue[front]);

        front++;

        if (front > rear) // Reset queue if it becomes empty

        {

            front =rear = -1;

        }

    }

}

void display()

 {

    if (front == -1 || front > rear) 

    {

        printf("Queue is empty\n");

    } else 

    {

        printf("Queue elements are: ");

        for (int i = front; i <= rear; i++) 

        {

            printf("%d ", queue[i]);

        }

        printf("\n");

    }

}

int main() 

{

    int choice, x;

    while (1) 

    {

        printf("\n1. Enqueue\n2. Dequeue\n3. Display\n4. Exit\n");

        printf("Enter your choice: ");

        scanf("%d", &choice);

        switch (choice) 

        {

            case 1:

                printf("Enter value to enqueue: ");

                scanf("%d", &x);

                enqueue(x);

                break;

            case 2:

                dequeue();

                break;

            case 3:

                display();

                break;

            case 4:

                return 0;

            default:

                printf("Invalid choice! Please try again.\n");

        }

    }

}

Comments

Post a Comment

Popular posts from this blog

SINGLE LINKED LIST by smd

-
  #include <stdio.h> #include <stdlib.h> int count = 0 ; struct node {     int data ;     struct node * next ; }   * head = NULL , * newnode , * trav ; void create_list () {     int value ;     struct node * temp ;     newnode = ( struct node * ) malloc ( sizeof ( struct node ));     printf ( "Enter the value to be inserted: " );     scanf ( " %d " , & value );     newnode -> data = value ;     newnode -> next = NULL ;     if ( head == NULL ) {         head = newnode ;     } else {         temp = head ;         while ( temp -> next != NULL )             temp = temp -> next ;         temp -> next = newnode ;     }     count ++ ; } void insert_at_begin () {     i...
Read more

CLL by smd

-
#include <stdio.h> #include <stdlib.h> int count = 0; struct node {  int data; struct node *next; }; struct node *head = NULL, *newnode, *temp; void create_circle_linked_list(); void insert_at_begin(); void insert_at_end(); void insert_at_specific_point(); void delete_at_begin(); void delete_at_end(); void delete_at_specific_point(); void display(); void create_circle_linked_list()  {  int value; printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(sizeof(struct node)); newnode->data = value; if (head == NULL)  {  head = newnode;  newnode->next = head;  } else  {  temp = head;  while (temp->next != head) temp = temp->next; temp->next = newnode; newnode->next = head;     }     count++; } void insert_at_begin()  { int value;  printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(sizeof(str...
Read more