Dsa/queueOp.c at main · dhancode/Dsa · GitHub

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
#include<stdio.h>
#include<stdlib.h>
struct queue
{
    int f;
    int r;
    int *arr;
    int size;
};

int isFull(struct queue *q)
{
    if(q->r==q->size-1)
    {
        return 1;
    }
    return 0;
}
void enqueue(struct queue *q,int val)
{
    if(isFull(q))
    {
        printf("queue overflow\n");
    }
    else
    {
        q->r++;
        q->arr[q->r]=val;
        printf("the value enqueued value is %d\n",val);
    }
}
int isEmpty(struct queue *q)
{
    if(q->f==q->r)
    {
        return 1;
    }
    return 0;
}
int dequeue(struct queue *q)
{
    int val=-1;
    if(isEmpty(q))
    {
        printf("queue underflow\n");
    }
    else
    {
        q->f++;
        val=q->arr[q->f];
    }
    return val;
}
int main()
{
    struct queue q;
    q.f=-1;
    q.r=-1;
    q.size=4;
    q.arr=(int *)malloc(q.size*sizeof(int));

    enqueue(&q,13);
    enqueue(&q,11);
    enqueue(&q,12);
    enqueue(&q,10);
    enqueue(&q,12);

    printf("the dequed element is %d\n",dequeue(&q));
    printf("the dequed element is %d\n",dequeue(&q));
    printf("the dequed element is %d\n",dequeue(&q));
    printf("the dequed element is %d\n",dequeue(&q));
    printf("the dequed element is %d\n",dequeue(&q));
}