Scribd
Upload
5 views4 pages

priority queue one dimensional array

The document presents an implementation of a priority queue using a one-dimensional array in C. It includes code for enqueueing, dequeueing, and peeking elements, along with helper functions for maintaining the heap property. The main function demonstrates the usage of the priority queue by enqueuing several values and displaying the dequeued element and the top element.

Uploaded by

Kedar Ghadge
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views4 pages

priority queue one dimensional array

The document presents an implementation of a priority queue using a one-dimensional array in C. It includes code for enqueueing, dequeueing, and peeking elements, along with helper functions for maintaining the heap property. The main function demonstrates the usage of the priority queue by enqueuing several values and displaying the dequeued element and the top element.

Uploaded by

Kedar Ghadge
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment No.

Name – Siddhesh Shivaji Kumbhar Roll No – 100

Implementation of Priority Queue through One Dimensional


Array
Code -
#include <stdio.h>
#include <stdlib.h>
#define MAX 100
typedef struct {
int items[MAX];
int size;
} PriorityQueue;

void swap(int* a, int* b)


{
int temp = *a;
*a = *b;
*b = temp;
}
void heapifyUp(PriorityQueue* pq, int index)
{
if (index
&& pq->items[(index - 1) / 2] > pq->items[index]) {
swap(&pq->items[(index - 1) / 2],
&pq->items[index]);
heapifyUp(pq, (index - 1) / 2);
}
}
void enqueue(PriorityQueue* pq, int value)
{
1
Assignment No.6

if (pq->size == MAX) {
printf("Priority queue is full\n");
return;
}

pq->items[pq->size++] = value;
heapifyUp(pq, pq->size - 1);
}
int heapifyDown(PriorityQueue* pq, int index)
{
int smallest = index;
int left = 2 * index + 1;
int right = 2 * index + 2;

if (left < pq->size


&& pq->items[left] < pq->items[smallest])
smallest = left;

if (right < pq->size


&& pq->items[right] < pq->items[smallest])
smallest = right;

if (smallest != index) {
swap(&pq->items[index], &pq->items[smallest]);
heapifyDown(pq, smallest);
}
}
int dequeue(PriorityQueue* pq)
{
if (!pq->size) {
printf("Priority queue is empty\n");
return -1;
}
2
Assignment No.6

int item = pq->items[0];


pq->items[0] = pq->items[--pq->size];
heapifyDown(pq, 0);
return item;
}
int peek(PriorityQueue* pq)
{
if (!pq->size) {
printf("Priority queue is empty\n");
return -1;
}
return pq->items[0];
}
int main()
{
PriorityQueue pq = { { 0 }, 0 };
enqueue(&pq, 3);
enqueue(&pq, 2);
enqueue(&pq, 15);
enqueue(&pq, 5);
enqueue(&pq, 4);
enqueue(&pq, 45);

printf("%d dequeued from queue\n", dequeue(&pq));


printf("Top element is %d\n", peek(&pq));
return 0;
}

3
Assignment No.6

OUTPUT –

You might also like