//堆排序
//交换两个值
void swap(int *a,int *b)
{
*a=*a^*b;
*b=*a^*b;
*a=*a^*b;
}
//调整堆 大顶堆
void adjustHeap(int *a,int size,int i)
{
if (i>size/2) //如果不是非终端结点
{
return;
}
int max_index=i;
int leafChild=2*i;
int rightChild=2*i+1;
if (leafChild>size-1||rightChild>size-1)
{
return;
}
if (a[i]>=a[leafChild]&&a[i]>=a[rightChild]) // >= 两个子树 不需要调整
{
return;
}
if (a[leafChild]>a[rightChild])
{
max_index=leafChild;
}
else
{
max_index=rightChild;
}
swap(&a[i],&a[max_index]);
if (max_index!=i) //需要调整
{
adjustHeap(a,size,max_index);
}
}
void buildHeap(int *a,int size)
{
for (int i=size/2;i>=0;i--)
{
adjustHeap(a,size,i);
}
}
void HeapSort(int *a,int size)
{
for (int i=1;i<size;i++)
{
swap(&a[0],&a[size-i]);
adjustHeap(a,size-i,0);
}
}
int main()
{
int size=12;
int a[]={15,14,5,7,12,18,10,56,15,70,25,30};
buildHeap(a,size);
HeapSort(a,size);
for (int i=0;i<size;i++)
{
cout<<a[i]<<endl;
}
system("pause");
return 0;
}