堆结构（堆建立，堆弹出，堆排序）

观看B站up主左程云视频的学习笔记~

#include<stdio.h>
#include<stdlib.h>
#define MAX_CAPACITY 105

//堆结构:根节点为树最大值
int Heap[MAX_CAPACITY];
int size=0;
//以0作为头结点下标
void swap(int *arr,int i,int j);

void InsertHeap(int *Heap,int i);
void Heapify(int *Heap,int i);//用来实现堆的弹出
int HeapPop(int *Heap);
void HeapSort(int *Heap);//按大小输出堆中元素

int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&Heap[i]);
        InsertHeap(Heap,i);
        size++;
    }
    // int ret=HeapPop(Heap);
    // printf("%d\n",ret);
    HeapSort(Heap);
    return 0;
}
void InsertHeap(int *Heap,int i){
  //Heap中的第i个元素进入堆结构
  //Heap数组-->Heap堆
  while(i>0&&Heap[i]>Heap[(i-1)/2]){
      //i=0不需要调整
      swap(Heap,i,(i-1)/2);
      i=(i-1)/2;
  }   
}
void Heapify(int *Heap,int i){
    //i位置节点值变小
    int l=2*i+1;//左节点下标
    while (l<size)
    {
        int bestChild=(l+1<size&&Heap[l+1]>Heap[l])?l+1:l;
        int best=(Heap[i]>Heap[bestChild])?i:bestChild;
        if(best==i){
            //调整结束
            break;
        }
        swap(Heap,i,best);
        i=bestChild;
        l=2*l+1;
    }
}
int HeapPop(int *Heap){
  //将堆尾的值放至堆顶
  if(size==0){
     return -1;
  }
  int ret=Heap[0];
  Heap[0]=Heap[size-1];
  size--;
  Heapify(Heap,0);
  return ret;
}
void HeapSort(int *Heap){
    while(size>0){
      int num=HeapPop(Heap);
      printf("%d ",num);
    }
    return;
}
void swap(int *arr,int i,int j){
    int tem=arr[i];
    arr[i]=arr[j];
    arr[j]=tem;
}