#include <stdio.h>
#include <stdlib.h>
void swap(int arr[], int i, int j)
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
void heapify(int arr[], int n, int i)
{
int left = 2 * i + 1;
int right = 2 * i + 2;
int max = i;
if (left < n && arr[left] > arr[max]) //和左节点比较,如果左节点大,则标记为最大
{
max = left;
}
if (right < n && arr[right] > arr[max]) //右节点和最大节点比较,如果右节点大,则标记为最大
{
max = right;
}
if (max != i) {
swap(arr, max, i); //把当前节点和最大节点交换
heapify(arr, n, max); //由于调整了节点,顺序已经被打乱,继续对最大节点下的子节点进行堆化
}
}
//构造大根堆: 构造相对有序的堆: 父节点不小于(或者不大于)子节点
void buildMaxHeap(int arr[], int n)
{
for (int i = n / 2 - 1; i >= 0; i--)
heapify(arr, n, i);
}
void heapSort(int arr[], int n)
{
buildMaxHeap(arr, n);
for (int i = n - 1; i >= 0; i--)
{
swap(arr, 0, i);
heapify(arr, i, 0);
}
}
void display(int num[], int count)
{
int i;
for (i = 0; i < count; i++)
{
printf("%d\t", num[i]);
}
printf("\n");
}
int main() {
int data[] = { 12, 28, 35, 82, 36, 63, 76, 45 };
int count = 8;
display(data, count);
heapSort(data, count);
display(data, count);
system("Pause");
return 0;
}