-
Notifications
You must be signed in to change notification settings - Fork 0
/
priorityQueue.c
88 lines (78 loc) · 1.91 KB
/
priorityQueue.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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <stdio.h>
struct queue {
int data;
int priority;
} q[100];
int front = -1, rear = -1, size;
void enqueue(int d, int p) {
if (rear == size - 1) {
printf("Queue is full\n");
} else {
if (front == -1) {
front = 0;
}
rear++;
q[rear].data = d;
q[rear].priority = p;
int i = rear;
while (i > front && q[i].priority < q[i - 1].priority) {
struct queue temp = q[i];
q[i] = q[i - 1];
q[i - 1] = temp;
i--;
}
}
}
void dequeue() {
if (front == -1) {
printf("Queue is empty\n");
} else {
printf("Deleted element: %d\n", q[front].data);
if (front == rear) {
front = rear = -1;
} else {
front++;
}
}
}
void display() {
if (front == -1) {
printf("\nQueue: Empty Queue\n");
} else {
printf("\nQueue: ");
for (int i = front; i <= rear; i++) {
printf("%d(p%d)\t", q[i].data, q[i].priority);
}
printf("\n");
}
}
void main() {
int o = 0, d, p;
printf("Enter The Size of The Queue: ");
scanf("%d", &size);
printf("\n\t\t ============= MENU =============");
printf("\n\t\t 1) Enqueue");
printf("\n\t\t 2) Dequeue");
printf("\n\t\t 3) Exit");
printf("\n\t\t ================================\n");
while (o != 3) {
display();
printf("\nEnter Your Option: ");
scanf("%d", &o);
switch (o) {
case 1:
printf("Enter The Data And Priority: ");
scanf("%d %d", &d, &p);
enqueue(d, p);
break;
case 2:
dequeue();
break;
case 3:
printf("Closing...\n");
break;
default:
printf("Invalid choice!\n");
}
}
}