#include <iostream>
using namespace std;
typedef int ElementType;
typedef struct HeapStruct* MaxHeap;
#define MaxData 1000;
struct HeapStruct{
ElementType * data;//存储堆元素的数组
int size;//堆的当前元素个数
int capacity;//堆的最大容量
};
MaxHeap Creat(MaxHeap H)
{
//这里假设所有H->size个元素已经存在H->data[]中
int i;
//从最后一个结点的父结点开始
for (i = H->size / 2; i > 0; i--)
PercDown(H, i);
}
void PercDown(MaxHeap H, int p) {
int Parent, child;
ElementType x;
x = H->data[p];
for (Parent = p; Parent * 2 <= H->size; Parent = child) {
child = Parent * 2;
if (child != H->size && H->data[child] < H->data[child + 1])child++;
if (x >= H->data[child])break;
else H->data[Parent] = H->data[child];
}
H->data[Parent] = x;
}
bool IsFull(MaxHeap H)
{
return (H->size == H->capacity);
}
void Insert(MaxHeap H,ElementType item){
int i;
if (IsFull(H)) {
cout << "最大堆已满" << endl;
return;
}
i = ++H->size;//i指向插入后堆中的最后一个元素的位置
for (; H->data[i / 2] < item; i /= 2)
H->data[i] = H->data[i / 2];//向下过滤结点
H->data[i] = item;//将item插入
}
bool IsEmpty(MaxHeap H){
return (H->size == 0);
}
ElementType DeleteMax(MaxHeap H)
{
int Parent, Child;
ElementType MaxItem, temp;
if (IsEmpty(H)) {
cout << "最大堆已为空" << endl;
return;
}
MaxItem = H->data[1];
temp = H->data[H->size--];
for (Parent = 1; Parent * 2 <= H->size; Parent = Child) {
Child = Parent * 2;
if (H->data[Child] < H->data[Child + 1] && Child != H->size) {
Child++;
}
if (temp >= H->data[Child])break;
else H->data[Parent] = H->data[Child];
}
H->data[Parent] = temp;
return MaxItem;
}
c++实现堆
最新推荐文章于 2024-03-26 23:29:24 发布