forked from Sai-02/Data-Structures-using-C
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCIRCULAR QUEUE USING ARRAY
More file actions
90 lines (87 loc) · 2 KB
/
CIRCULAR QUEUE USING ARRAY
File metadata and controls
90 lines (87 loc) · 2 KB
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
#include <stdio.h>
#include <conio.h>
#define SIZE 5
void enQueue(int);
void deQueue();
void display();
int cQueue[SIZE], front = -1, rear = -1;
void main()
{
int choice, value;
clrscr();
while (1)
{
printf("\n****** MENU ******\n");
printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice)
{
case 1:
printf("\nEnter the value to be insert: ");
scanf("%d", &value);
enQueue(value);
break;
case 2:
deQueue();
break;
case 3:
display();
break;
case 4:
exit(0);
default:
printf("\nPlease select the correct choice!!!\n");
}
}
}
void enQueue(int value)
{
if ((front == 0 && rear == SIZE - 1) || (front == rear + 1))
printf("\nCircular Queue is Full! Insertion not possible!!!\n");
else
{
if (rear == SIZE - 1 && front != 0)
rear = -1;
cQueue[++rear] = value;
printf("\nInsertion Success!!!\n");
if (front == -1)
front = 0;
}
}
void deQueue()
{
if (front == -1 && rear == -1)
printf("\nCircular Queue is Empty! Deletion is not possible!!!\n");
else
{
printf("\nDeleted element : %d\n", cQueue[front++]);
if (front == SIZE)
front = 0;
if (front - 1 == rear)
front = rear = -1;
}
}
void display()
{
if (front == -1)
printf("\nCircular Queue is Empty!!!\n");
else
{
int i = front;
printf("\nCircular Queue Elements are : \n");
if (front <= rear)
{
while (i <= rear)
printf("%d\t", cQueue[i++]);
}
else
{
while (i <= SIZE - 1)
printf("%d\t", cQueue[i++]);
i = 0;
while (i <= rear)
printf("%d\t", cQueue[i++]);
}
}
}