算法导论 练习题 6.5-3

#include <stdio.h>
#include <limits.h>
#include "最小堆.h"

int heapMinimum(int a[],int len)
{
	if(len<1)
	{
		printf("Heap is empty!");
		return INT_MIN;;
	}
	return a[1];
}

int heapExtractMin(int a[],int len)
{
	int t=a[1];
	a[1]=a[len];
	minHeapify(a,1,len-1);
	return t;
}

void heapDecreaseKey(int a[],int i,int key)
{
	if(key>a[i])
	{
		printf("更新的键值应该小于原先键值！");
		return;
	}
	a[i]=key;
	for(int j=i/2;j>=1 && a[j]>a[i];)
	{
		int temp=a[j];
		a[j]=a[i];
		a[i]=temp;
		i=j;
		j=i/2;
	}
}

void minHeapInsert(int a[],int len,int key)
{
	a[len+1]=INT_MAX;
	heapDecreaseKey(a,len+1,key);
}