二叉队排序

#include "pch.h"
#include <stdio.h>
void swap(int array[],int x, int y)
{
	int tmp = array[x];
	array[x] = array[y];
	array[y] = tmp;
}
void heapfy(int array[], int n, int i)
{
	if (i >= n) {
		return;
	}
	int c1 = i * 2 + 1;
	int c2 = i * 2 + 2;
	int max = i;
	if (c1 < n && array[max] < array[c1]) {
		max = c1;
	}
	if (c2 < n && array[max] < array[c2]) {
		max = c2;
	}
	if (max != i) {
		swap(array, max, i);
		heapfy(array, n, max);
	}
}
void build_heap(int array[], int n)
{
	int lastnode = n - 1;
	for (int i = (lastnode - 1) / 2; i >= 0; i--)
	{
		heapfy(array, n, i);
	}
}

void sort_heap(int array[], int n)
{
	build_heap(array, n);
	for (int i = n - 1; i >= 0; i--) {
		swap(array, i, 0);
		build_heap(array, i);
	}
}
int main(void)
{
	int array[] = { 8,9,6,5,3,2,101,7,10 };
	int n = sizeof(array) / sizeof(int);
	sort_heap(array, n);
	for (int i = 0; i < n; i++) {
		printf("%d\n", array[i]);
	}
	return 0;
}