-
Notifications
You must be signed in to change notification settings - Fork 6
/
QUEUEARR.C
84 lines (78 loc) · 1.17 KB
/
QUEUEARR.C
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include<stdio.h>
#include<conio.h>
#define LENGTH 5
int queue[LENGTH];
int front=0,rear=0;
void add(int);
void del();
void list();
void main()
{
int ch,n;
do
{
clrscr();
printf("\n\tQUEUE OPERATIONS\n");
printf("\n\t\t1.ADD");
printf("\n\t\t2.DELETE");
printf("\n\t\t3.LIST");
printf("\n\t\t4.EXIT");
printf("\n\n\tEnter your choice(1-4) : ");
scanf("%d",&ch);
switch(ch)
{
case 1:
printf("\nEnter the element : ");
scanf("%d",&n);
add(n);
break;
case 2:
del();
break;
case 3:
list();
break;
default:continue;
}
getch();
}while(ch!=4);
}
void add(int x)
{
int i;
if(rear==LENGTH && front==0)
{
printf("\nSorry, queue is full...");
return;
}
if(rear==LENGTH)
{
for(i=front;i<rear;i++)
queue[i-front]=queue[i];
rear=rear-front;
front=0;
}
queue[rear++]=x;
printf("\n%d is added...",x);
}
void del()
{
if(front==rear)
{
printf("\nSorry, queue is empty...");
return;
}
printf("\n%d is removed...",queue[front++]);
}
void list()
{
int i;
if(front==rear)
{
printf("\nSorry, queue is empty...");
return;
}
printf("\nThe queue :\n\n");
for(i=front;i<rear;i++)
printf("%d\t",queue[i]);
}