-
Notifications
You must be signed in to change notification settings - Fork 0
/
Priority_Queue_Arrays.c
141 lines (123 loc) · 2.79 KB
/
Priority_Queue_Arrays.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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include <stdio.h>
#include <stdlib.h>
int front = -1, rear = -1, size;
int *CreateArray(int *array, int size)
{
array = (int *)malloc(size * sizeof(int));
return array;
}
void ShiftLeft(int *array, int size, int index)
{
for (int i = index; i < size; i++)
{
array[i] = array[i + 1];
}
}
void PrintQueue(int *queue)
{
if (front == -1 && rear == -1)
{
printf("Queue is empty.\n");
return;
}
for (int i = front; i <= rear; i++)
{
printf("%d\t", queue[i]);
}
printf("\n");
}
int Priority_Enqueue(int *array, int size, int data)
{
if (rear == size - 1)
{
printf("Queue is full. Cannot enqueue.\n");
return -1;
}
if (front == -1 && rear == -1)
{
front = rear = 0;
array[rear] = data;
}
else
{
if (data >= array[front])
{
for(int i = rear; i >= front; i--){
if(data >= array[i]){
for(int j = rear; j > i; j--){
array[j+1] = array[j];
}
array[i+1] = data;
break;
}
}
}
else
{
for (int i = rear; i >= front; i--)
{
array[i + 1] = array[i];
}
array[front] = data;
}
rear = (rear + 1) % size;
}
return 0;
}
int Dequeue(int *array, int size)
{
int item;
if (front == -1 && rear == -1)
{
printf("Queue is empty. Cannot dequeue.\n");
return -1;
}
item = array[front];
if (front == rear)
{
front = rear = -1;
}
else
{
front = (front + 1) % size;
}
printf("Dequeued element: %d\n", item);
front--;
rear--;
ShiftLeft(array, size, 0);
}
int main()
{
int size;
printf("Enter the size of the array: ");
scanf("%d", &size);
int *queue = CreateArray(queue, size);
do
{
printf("\n1. Display\n2. Enqueue\n3. Dequeue\n0. Exit\n");
printf("Your choice: ");
int choice;
scanf("%d", &choice);
switch (choice)
{
case 1:
PrintQueue(queue);
break;
case 2:
printf("Enter the element to enqueue: ");
int data;
scanf("%d", &data);
Priority_Enqueue(queue, size, data);
break;
case 3:
Dequeue(queue, size);
break;
case 0:
printf("Exiting...\n");
exit(0);
default:
printf("Invalid choice. Please try again.\n");
}
} while (1);
free(queue);
}