堆排序及其源码

最新推荐文章于 2024-02-19 12:48:53 发布

欧陈

最新推荐文章于 2024-02-19 12:48:53 发布

阅读量600

点赞数

分类专栏：算法文章标签：堆堆排序 C C++

本文链接：https://blog.csdn.net/owen_kop/article/details/8703195

版权

算法专栏收录该内容

6 篇文章 1 订阅

订阅专栏

void MaxHeap(int a[], int index, int length);
void BuildMaxHeap(int a[], int length);
void HeapSort(int a[], int length);
int _tmain(int argc, _TCHAR* argv[])
{
srand((unsigned int)time(NULL));
int a[10];
for(int i=0;i<10;i++)
a[i]=rand()%500;
HeapSort(a,10);
for(int i=0;i<10;i++)
printf("%d ",a[i]);
return 0;
}
void MaxHeap(int a[], int index, int length)
{
int left=index*2+1;
int right=index*2+2;
int largest=index;
if(left<length && a[largest]<a[left])
largest=left;
if(right<length && a[largest]<a[right])
largest=right;
if(largest!=index)
{
int temp=a[index];
a[index]=a[largest];
a[largest]=temp;
MaxHeap(a,largest,length);
}
}
void BuildMaxHeap(int a[], int length)
{
for(int i=length/2;i>=0;i--)
MaxHeap(a,i,length);
}
void HeapSort(int a[], int length)
{
BuildMaxHeap(a,length);
int i=length-1;
for(;i>=0;i--)
{
int temp=a[0];
a[0]=a[i];
a[i]=temp;
length=length-1;
MaxHeap(a,0,length);
}
}