-
Notifications
You must be signed in to change notification settings - Fork 0
/
priority_queue.c
86 lines (80 loc) · 1.98 KB
/
priority_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
75
76
77
78
79
80
81
82
83
84
85
86
#include<stdio.h>
#define MAX 5
int front = -1, rear = -1, i, j;
struct priority_queue
{
int value, priority;
}item[MAX];
void insert()
{
struct priority_queue temp;
if(front == rear + 1 || front == 0 && rear == MAX - 1)
{
printf("\nQueue is full.\n");
return;
}
printf("Enter the value and priority of element: ");
if(front == -1)
front = 0;
rear = (rear + 1) % MAX;
scanf("%d%d", &item[rear].value, &item[rear].priority);
for(i = front; i != rear; i = (i + 1) % MAX)
{
for(j = front; j != rear; j = (j + 1) % MAX)
{
if(item[j].priority > item[(j + 1) % MAX].priority)
{
temp = item[j];
item[j] = item[(j + 1) % MAX];
item[(j + 1) % MAX] = temp;
}
}
}
}
void delete()
{
if(front == -1)
{
printf("\nQueue is empty.\n");
return;
}
printf("Deleted element => Value: %d\tPriority: %d\n", item[front].value, item[front].priority);
if(front == rear)
{
front = rear = -1;
}
else
front = (front + 1) % MAX;
}
void display()
{
if(front == -1)
{
printf("\nQueue is empty.\n");
return;
}
printf("\nPriority queue:\n");
for(i = front; i != rear; i = (i + 1) % MAX)
printf("Value: %d\tPriority: %d\n", item[i].value, item[i].priority);
printf("Value: %d\tPriority: %d\n", item[i].value, item[i].priority);
}
void main()
{
int n;
do
{
printf("\n\t\t\tMENU\n");
printf("\n1. Insert\t2. Delete\t3. Display\t4.Exit");
printf("\nEnter choice: ");
scanf("%d", &n);
switch(n)
{
case 1: insert();
break;
case 2: delete();
break;
case 3: display();
break;
}
}while(n >= 1 && n <= 3);
}