forked from sbmxc/hacktoberfest
-
Notifications
You must be signed in to change notification settings - Fork 0
/
QueueUsingArray.c
110 lines (93 loc) · 1.25 KB
/
QueueUsingArray.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
#include<stdio.h>
#include<conio.h>
# define n 10
void insert(int[],int,int *,int *);
int del(int[],int,int *,int *);
void display();
int queue[n],front=-1,rear=-1;
int main()
{
int choice,value,data;
char ans;
do
{
printf("\nEnter your choice\n");
printf("1.Insert\n");
printf("2.Delete\n");
printf("3.Display\n");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("Enter the element to be inserted\n");
scanf("%d",&value);
insert(queue,value,&front,&rear);
break;
case 2:
value=del(queue,data,&front,&rear);
printf("Deleted element is %d\n",value);
break;
case 3:
display();
break;
default:
printf("Invalid Choice\n");
}
printf("\nDo you want to continue?\n");
ans=getche();
printf("\n");
}
while(ans=='Y' || ans=='y');
getch();
}
void insert(int q[],int item,int *front,int *rear)
{
if(*rear>=n-1)
{
printf("Overflow\n");
return;
}
if(*front==-1)
{
*front=0;
*rear=0;
q[*rear]=item;
return;
}
else
{
*rear=*rear+1;
q[*rear]=item;
return;
}
}
int del(int q[],int d,int *front,int *rear)
{
if(*front==-1||*front>*rear)
{
printf("Underflow\n");
d=-1;
return d;
}
if(*front<*rear)
{
*front=*front+1;
d= q[*front-1];
return d;
}
else
{
d= q[*rear];
*front=-1;
*rear=-1;
return d;
}
}
void display()
{
int i;
for(i=front;i<=rear;i++)
{
printf("%d\n",queue[i]);
}
}