/* Name: Linear Queue Copyright: www.micted.weebly.com Author: Nawaraj Ghimire ([email protected]) Date: 28/10/13 13:27 Description:Implementation of linear queue */ #include<conio.h> #include<stdio.h> #include<process.h> void insert(); void remove(); void display(); int queue[5], front=-1,rear=-1; void main() { int choice; do { printf("\n 1.INSERT"); printf("\n 2. REMOVE"); printf("\n 3.DISPLAY"); printf("\n 4.EXIT"); printf("\n Enter Your Choice"); scanf("%d",&choice); switch(choice) {case 1: insert(); break; case 2: remove(); break; case 3: display(); break; case 4: exit(0); } }while(choice!=4); getch(); } void insert() {int item; if(rear==4) printf("\n Queue Overflow now." ); else {printf("\n Enter value of item:"); scanf("%d",&item); if(rear==-1) {rear=0; front=0; } else rear=rear+1; queue[rear]=item; printf("\n %d Item is inserted succesfully",item); } } void remove() {int item; if(front==-1) printf("\n Queue Under flow now"); else {item=queue[front]; if(front==rear) {front=-1; rear=-1; } else front=front+1; printf("\n%d Item Removed Succedsfully",item); } } void display() {int i; if(rear==-1) printf("\n queue is empty"); else {for(i=rear;i>=front; i--) printf(" %d \t",queue[i]); } }