用C语言讲解删除队列中的元素

#include #define MAX 50 void insert(); int array[MAX]; int rear = - 1; int front = - 1; main(){ int add_item; int choice; while (1){ printf("1.Insert element to queue

"); printf("3.Display elements of queue

"); printf("4.Quit

"); printf("Enter your choice : "); scanf("%d", &choice); switch (choice){ case 1: insert(); break; case 2: delete(); case 3: display(); break; case 4: exit(1); default: printf("Wrong choice

"); } } } void insert(){ int add_item; if (rear == MAX - 1) printf("Queue Overflow

"); else{ if (front == - 1) /*If queue is initially empty */ front = 0; printf("Inset the element in queue : "); scanf("%d", &add_item); rear = rear + 1; array[rear] = add_item; } } void display(){ int i; if (front == - 1) printf("Queue is empty

"); else{ printf("Queue is :

"); for (i = front; i rear){ printf("Queue Underflow

"); return ; } else{ printf("Element deleted from queue is : %d

",array[front]); front = front + 1; } }