void insert(int *heap,int *n,int e)
{
if(*n==20)
{
cout<<"Heap is full!"<<endl;
}
int i;
i=++(*n);
heap[i]=e;
int temp;
while(heap[i]>heap[i/2] && i!=1)
{
temp=heap[i];
heap[i]=heap[i/2];
heap[i/2]=temp;
i=i/2;
}
}
最大堆插入算法
最新推荐文章于 2024-01-10 01:28:10 发布