Implementation of Queue Using Array
Implementation of Queue Using Array
#include <iostream>
void Insert() {
int val;
if (rear == n - 1)
cout<<"Queue Overflow"<<endl;
else {
if (front == - 1)
front = 0;
cin>>val;
rear++;
queue[rear] = val;
void Delete() {
return ;
} else {
front++;;
}
void Display() {
if (front == -1)
cout<<"Queue is empty"<<endl;
else {
cout<<queue[i]<<" ";
cout<<endl;
int main()
int ch;
cout<<"4. Exit"<<endl;
do {
cin>>ch;
switch (ch) {
case 1: Insert();
break;
case 2: Delete();
break;
case 3: Display();
break;
case 4: cout<<"Exit"<<endl;
break;
} while(ch!=4);
return 0;
}
Output: