-
Notifications
You must be signed in to change notification settings - Fork 0
/
06_queue.c
77 lines (61 loc) · 952 Bytes
/
06_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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define QUEUE_SIZE 10
int Queue[QUEUE_SIZE];
int front = -1;
int rear = -1;
void enqueue(int item)
{
rear = rear + 1;
if(rear >= QUEUE_SIZE) {
printf("Queue is full....\n");
return;
}
Queue[rear] = item;
}
void dequeue(int *item)
{
if(front == rear) {
printf("Queue is empty....\n");
return;
}
front = front + 1;
*item = Queue[front];
}
void PrintQueue(void)
{
int i=0;
printf("Content of Queue:\n");
if(QueueEmpty()) {
printf("Queue is Empty....\n");
return;
}
for(i=front; i<=rear; i++) {
printf("%d <-- ",Queue[i]);
}
printf("\n\n");
}
int QueueEmpty()
{
if(front == rear) return 1;
else
return 0;
}
int main()
{
int i=0;
int item=0;
front = 0;
for(i=1; i<QUEUE_SIZE; i++) {
enqueue(i);
}
PrintQueue();
while(!QueueEmpty()) {
dequeue(&item);
}
//dequeue(&item);
printf("Queue after deleting :\n");
PrintQueue();
return 0;
}