Priority Queue , 우선순위 큐

#include <stdio.h>
#define MAX_SIZE 100
int heap[MAX_SIZE];
int heapSize = 0;
int heapPush(int value)
{
	if (heapSize > MAX_SIZE)
	{
		printf("queue is full!");
		return 0;
	}
	heap[++heapSize] = value;
	int current = heapSize;
	while (current > 1 && heap[current] < heap[current / 2])
	{
		int temp = heap[current / 2];
		heap[current / 2] = heap[current];
		heap[current] = temp;
		current = current / 2;
	}
	return 1;
}
int heapPop(int *value)
{
	if (heapSize <= 0)
	{
		return -1;
	}
	*value = heap[1];
	heap[1] = heap[heapSize];
	heapSize--;
	int current = 1;
	while (current * 2 <= heapSize)
	{
		int child;
		if (current * 2 == heapSize)
		{
			child = current * 2;
		}
		else
		{
			child = heap[current * 2] < heap[current * 2 + 1] ? current * 2 : current * 2 + 1;
		}
		if (heap[current] < heap[child])
		{
			break;
		}
		int temp = heap[current];
		heap[current] = heap[child];
		heap[child] = temp;
		current = child;
	}
	return 1;
}