basic_programming/Circular_Queue.c at master · saibighnesh/basic_programming · 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
#include<stdio.h>
#include<conio.h>
#define N 5

int q[N],front=-1,rear=-1;

//insert an element
void enqueue(int x)
{
if(rear==-1 && front==-1)
{
rear=front=0;
q[rear]=x;
}
else if((rear+1)%N==front)
{
printf("Queue is full.");
}
else
{
rear=(rear+1)%N;
q[rear]=x;
}
}

//delete last element in queue
void dequeue()
{
if(front==-1 &&rear==-1)
{
printf("Queue is underflow");
}
else if(front==rear)
{
front=rear=-1;
}
else
{
//printf("%d",q[front]);
front=(front+1)%N;
}
}

//display all elements
void display()
{
int i=front;
if(front==-1&&rear==-1)
{
printf("Queue is underflow");
}
else
{
while(i!=rear)
{
printf("%d\n",q[i]);
i=(i+1)%N;
}
printf("%d\n",q[rear]);
}
getch();
}

//main function
void main()
{
clrscr();
enqueue(1);
enqueue(5);
enqueue(3);
enqueue(9);
enqueue(10);
enqueue(11);
display();
dequeue();
display();
enqueue(14);
display();
getch();
}