建堆的兩種方式

#include<stdio.h>
#include<stdlib.h>
#define mindata             -10001
#define maxsize             1000
typedef int ElemType; 
typedef struct  {                       //堆的存儲結構表示?
    ElemType    *Elems;
    int          size;
    int          capacity;  
}HeapStruct,*MinHeap;

void MinHeapCreate (int Maxsize,MinHeap &H)
{
    H->Elems =(ElemType *) malloc((maxsize+1)*sizeof(ElemType));
    H->size=0;
    H->capacity=maxsize;
    H->Elems[0]=mindata;
} 

void swap(MinHeap &H,int a,int b)
{
    int temp;
    temp = H->Elems[a];
    H->Elems[a] = H->Elems[b];
     H->Elems[b]=temp;
}

void shiftdown(MinHeap &H,int i)
{
    int t,flag=0;//flag用以標記是否需要繼續向下調整 
    while(i*2<=H->size&&flag==0)
    {   //首先判斷它和左兒子的關係，保用t記錄值較小的節點下標 
        if(H->Elems[i]>H->Elems[2*i]){
            t=i*2;
        }else{
            t=i;
        }
        //假如他有右兒子，再對右兒子進行討論
        if(i*2 + 1 <= H->size)
        {
            //如果他的右兒子值更小，更新較小節點的下標給t
            if(H->Elems[t]>H->Elems[i*2+1])
                t=i*2+1;
        }
        //如果發現最小編號不是自己，說明子結點中有比父結點更小的
        if(t!=i)
        {
            swap(H,t,i);
            i=t;
        }else{
            flag=1;
        } 
    }
}

void BulidMinHeap(MinHeap &H) 
{
    int i;
    for(i=H->size/2;i>0;i--)
        shiftdown(H,i);
}

int compare(MinHeap &H1,int child,int parent )
{
    int flag=0;
        if(H1->Elems[child]<H1->Elems[parent])
            flag=1; 
    return flag;        
}

void MinHeapinsert(MinHeap &H1,int N)
{
    scanf("%d",&H1->Elems[1]);
    H1->size++;
    int i;
        for(i=2;i<N+1;i++)
        {
        scanf("%d",&H1->Elems[i]);
        H1->size++;
        int j=i;
        while(j/2>0&&j!=1){
        if(compare(H1,j,j/2)==1)
            swap(H1,j,j/2);
            j=j/2;  
        }
        }       
}
void print(MinHeap &H,int M,int *xb)
{
    for(int i=0;i<M;i++)
    {
        scanf("%d",&xb[i]);
    }
    for(int i=0;i<M;i++)
    {
        int a=xb[i];
        while(a>1)
        {
            printf("%d ",H->Elems[a]);
            a=a/2;
        }
        printf("%d\n",H->Elems[1]); 
    }
}
void gettop(MinHeap &H)
{
    int top = H->Elems[1];
    H->Elems[1]=H->Elems[H->size];
    H->size--;
    BulidMinHeap(H);
    printf("%d\n",top);
    for(int i=1;i<=H->size;i++)
    printf("%d ",H->Elems[i]);
}
main()
{
    printf("調整法建堆\n");
    int N,M;
    MinHeap H =(MinHeap) malloc (sizeof(HeapStruct));
    MinHeapCreate (maxsize,H);
    scanf("%d %d",&N,&M);
    getchar();
    for(int i=1;i<N+1;i++){
        scanf("%d",&H->Elems[i]);
        H->size++;
    }       
    BulidMinHeap(H); 
    for(int i=1;i<=H->size;i++)
    printf("%d ",H->Elems[i]);
    putchar(10);
    int xb[maxsize];
    print(H,M,xb);

    printf("插入法建堆\n"); 
    MinHeap H1 =(MinHeap) malloc (sizeof(HeapStruct));
    MinHeapCreate (maxsize,H1);
    scanf("%d %d",&N,&M);
    MinHeapinsert(H1,N);
    for(int i=1;i<=H1->size;i++)
    printf("%d ",H1->Elems[i]);
    putchar(10);
    print(H1,M,xb);
    //取頂元素函數，已知堆棧是去一堆數中的最小值或者最大值，則取得就是堆中最大值或者最小值 
    gettop(H);

    return 0;   
}