C++大根堆

#include"stdafx.h"
#include<iostream>
using namespace std;
//获取父节点
///    大根堆  /
void heap_adjust(int *a,int node,const int isize)
{
int leftnode = 2*node;
int rightnode = 2*node+1;
int largest = node;
if(leftnode<=isize && a[leftnode]>a[node])
{
largest = leftnode;
}
if(rightnode<=isize && a[rightnode]>a[largest])
{
largest = rightnode;
}
if(largest!=node)
{
swap(a[node],a[largest]);
heap_adjust(a,largest,isize);
}
}


void bulid_max_heap(int *a,int isize)
{
for (int i=isize/2;i>0;--i)
{
heap_adjust(a,i,isize);
}
}


void heap_sort(int *a,int isize)
{
for(int i=isize;i>0;i--)
{
swap(a[1],a[i]);           //交换堆顶和最后一个元素，即每次将剩余元素中的最大者放到最后面 
heap_adjust(a,1,i-1);      //重新调整堆顶节点成为大顶堆
}
}


int main()
{
int a[] = {7,1,2,13,23,45,335,5};


bulid_max_heap(a,a[0]);
for (int i=1;i<8;i++)
{
printf("%d\n",a[i]);
}
printf("排序后\n");
heap_sort(a,a[0]);
for (int i=7;i>0;i--)
{
printf("%d\n",a[i]);
}
system("pause");
return 0;
}