-
Notifications
You must be signed in to change notification settings - Fork 0
/
Linear_Queue.c
133 lines (118 loc) · 2.07 KB
/
Linear_Queue.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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
//IMPLEMENTING LINEAR QUEUE USING ARRAY
#include<stdio.h>
#include<conio.h>
//Declaring global variables
#define MAX 10
int queue[MAX];
int front=-1,rear=-1;
void insert(void);
int delete_element(void);
int peek(void);
void display(void);
int main()
{
int option,val;
printf("**************LINEAR QUEUE*************");
printf("\n***************MAIN MENU***************");
printf("\n1.Insert an element.");
printf("\n2.Delete an element.");
printf("\n3.Peek.");
printf("\n4.Display the queue.");
printf("\n5.EXIT");
top:
printf("\nYour option:\t");
scanf("%d",&option);
switch(option)
{
case 1:
insert();
break;
case 2:
val=delete_element();
if(val!=-1)
printf("\nElement deleted:\t%d",val);
break;
case 3:
val=peek();
if(val!=-1)
printf("\nElement in the front of the queue is:\t%d",val);
break;
case 4:
display();
break;
case 5:
exit(0);
break;
default:
printf("\nINVALID INPUT.");
break;
}
goto top;
return 0;
}
//-----------------------------------------------------------------------------------------------------------
//INSERTION
void insert(void)
{
int num;
if(rear==MAX-1)
printf("\nQUEUE IS FULL(OVERFLOW CONDITION)");
else
{
printf("\nEnter the element you wish to insert:\t");
scanf("%d",&num);
if(front==-1 && rear==-1)
{
//EMPTY QUEUE
front=0;
rear=0;
}
else
{
rear=rear+1;
}
}
queue[rear]=num;
}
//DELETION
int delete_element(void)
{
int val;
if(front==-1 || front>rear)
{
printf("\nQUEUE IS EMPTY.(UNDERFLOW)");
return -1;
}
else
{
val=queue[front];
front=front+1;
}
return val;
}
//PEEK-RETURN ELEMENT AT FRONT
int peek(void)
{
if(front==-1 || front>rear)
{
printf("\nQUEUE IS EMPTY.");
return -1;
}
else
{
return queue[front];
}
}
//DISPLAY
void display(void)
{
int i;
printf("\n");
if(front==-1 || front>rear)
printf("\nQUEUE IS EMPTY.");
else
{
for(i=front;i<=rear;i++)
printf("%d\t",queue[i]);
}
}