Hacktoberfest2k22/Queue_using array.c at main · Namrata8789/Hacktoberfest2k22 · 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
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
#include <stdio.h>
#define N 5
int A[N], front = -1, rear = -1;
int Enque(int n)
{
    if (rear == -1)
    {
        front++;
        rear++;
        A[rear] = n;
    }
    else if (rear == N - 1)
    {
        printf("Queue is full\n");
    }
    else
    {
        rear++;
        A[rear] = n;
    }
}
int Deque()
{
    int n;
    if (front == -1)
    {
        printf("Queue is empty\n");
    }
    else if (front == rear)
    {
        printf("the element %d is deleted from the Queue\n", A[front]);
        front++;
        printf("Queue is empty\n");
    }
    else
    {
        printf("the element %d is deleted from the Queue\n", A[front]);
        front++;
    }
}
int Display()
{
    int i;
    if (rear == -1 || front>rear)
    {
        printf("Queue is empty\n");
    }
    else
    {
        for (i = front; i < N; i++)
        {
            printf("%d\t", A[i]);
        }
    }
    printf("\n");
}
int Peek()
{
    if (front >rear)
    {
        printf("Queue is empty\n");
    }
    else
    {
        printf("%d", A[front]);
    }
}
int isfull()
{
    if (rear == N - 1)
    {
        printf("Queue is full\n");
    }
    else if(rear<front)
    {
        printf("Queue is empty\n");
    }
    else
    {
        printf("Queue has space \n");
    }
}
int isempty()
{
    if (front == -1 || front>rear)
    {
        printf("Queue is empty\n");
    }
    else
    {
        printf("Queue has elements \n");
    }
}
int main()
{
    int x, ch;
    do
    {
        printf("Press 0 to exit \n");
        printf("Press 1 for Enque operation \n");
        printf("Press 2 for Dequeue operation \n");
        printf("Press 3 for Peek operation \n");
        printf("Press 4 to check the queue is full or not\n");
        printf("Press 5 to check the queue is empty or not\n");
        printf("Press 6 for Display operation \n");
        scanf("%d", &ch);
        switch (ch)
        {
        case 1:
        {
            printf("Enter the element to be pushed in the queue\n");
            scanf("%d", &x);
            Enque(x);
            break;
        }
        case 2:
        {
            Deque();
            break;
        }
        case 3:
        {
            Peek();
            break;
        }
        case 4:
        {
            isfull();
            break;
        }
        case 5:
        {
            isempty();
            break;
        }
        case 6:
        {
            Display();
            break;
        }
        default:
        {
            printf("Invalid input\n");
            break;
        }
        }
    } while (ch != 0);
}