#include <stdlib.h>
#include <stdio.h>
void AdjustHeap(int *arr, int s, int e) {
int temp = arr[s];
for(int j=2*s+1; j<=e; j=j*2+1) {
if(j<e && arr[j] > arr[j+1]) ++j;
if(arr[j] > temp) break;
arr[s] = arr[j];
s = j;
}
arr[s] = temp;
return;
}
void HeapSort(int *arr, int length) {
for(int i=length/2-1; i>=0; --i)
AdjustHeap(arr, i, length-1);
for(int i=length-1;i>=0;--i) {
int temp = arr[i];
arr[i] = arr[0];
arr[0] = temp;
AdjustHeap(arr, 0, i-1);
}
}
int main() {
int arr[] = {234,3,54,673,2,35,1246,46,624,789};
HeapSort(arr, 10);
for(int i=0; i<10; ++i)
printf("%d ", arr[i]);
system("pause");
}
堆排序_C语言实现
最新推荐文章于 2022-11-22 11:44:38 发布