-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue using array.c
More file actions
81 lines (76 loc) · 1.09 KB
/
queue using array.c
File metadata and controls
81 lines (76 loc) · 1.09 KB
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
#include<stdio.h>
#include<stdlib.h>
int queue[10];
int front=-1;
int rear=-1;
void insert(int);
int delete();
void display();
int main()
{
int ch,item;
while(1)
{
printf("1=Insert 2=delete 3=display 4=exit\n");
printf("Enter the value : ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("enter the item\n");
scanf("%d",&item);
insert(item);
break;
case 2: printf("deleted item is %d\n",delete());
break;
case 3: display();
break;
case 4: exit(0);
}
}
}
void insert(int item)
{
if(rear==9)
{
printf("Queue Overflow\n");
}
else if(front<0)
{
front++;
rear++;
queue[rear]=item;
}
else
{
rear++;
queue[rear]=item;
}
}
int delete()
{
int x;
if(front<0)
{
printf("Underflow\n");
return 0;
}
else if(front==rear)
{
x=queue[front];
front=-1;
rear=-1;
return x;
}
else
{
x=queue[front];
front++;
return x;
}
}
void display()
{
int i;
for(i=front;i<=rear;i++)
printf("queue[%d] is %d\n",i,queue[i]);
}