forked from Aashutoshsharma002/algo
-
Notifications
You must be signed in to change notification settings - Fork 1
/
queue
85 lines (84 loc) · 1.14 KB
/
queue
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
84
85
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define max 100
void insert();
void delete_item();
void display();
int queue[max];
int front=-1;
int rear=-1;
int main()
{
int choice;
while(1)
{
printf("1.insert item in queue: ");
printf("\n2.delete item from queue: ");
printf("\n3.display items of queue: ");
printf("\n4.exit.");
printf("\nEnter your choice: ");
scanf("%d", &choice);
switch(choice)
{
case 1:
insert();
break;
case 2:
delete_item();
break;
case 3:
display();
break;
case 4:
exit(1);
default:
printf("Wrong choice!\n");
}
}
}
void insert()
{
int item;
if(rear==max-1)
{
printf("overflow!");
}
else
{
if(front==-1)
front=0;
printf("insert the item in queue: ");
scanf("%d", &item);
rear++;
queue[rear]=item;
}
}
void delete_item()
{
if(front==-1 || front>rear)
{
printf("underflow!");
return;
}
else
{
printf("deleted item is %d: \n", queue[front]);
front=front+1;
}
}
void display()
{
int i;
if(front==-1)
{
printf("Underflow!");
}
else
{
printf("Queue is : \n");
for(i=front;i<=rear;i++)
printf("%d ", queue[i]);
printf("\n");
}
}