forked from kavyanshpandey/hacktoberfest-2021
-
Notifications
You must be signed in to change notification settings - Fork 0
/
QueueCode.c
60 lines (56 loc) · 854 Bytes
/
QueueCode.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
#include<stdio.h>
#include<stdlib.h>
struct queue{
int size;
int f;
int r;
int *arr;
};
void enqueue(struct queue *q,int value)
{
if(isFull(q))
{
printf("this Queue is Full");
}
else
{
q->r=q->r+1;
q->arr[q->r]=value;
}
}
int isFull(struct queue *q)
{
if(q->r==q->size-1)
return -1;
return 0;
}
int isEmpty(struct queue *q)
{
if(q->f==q->r)
return 1;
return 0;
}
int dequeue(struct queue *q)
{
int a=-1;
if(isEmpty(q))
{
printf("This Queue is Empty");
}
else
{
q->f++;
q=q->arr[q->f];
}
return a;
}
int main()
{
struct queue q;
q.size=100;
q.f=q.r=-1;
q.arr=(int *)malloc(q.size*sizeof(int));
enqueue(&q,12);
enqueue(&q,5);
printf("Dequeuing element %d",dequeue(&q));
}