c++实现_堆排序

#include<iostream>

using namespace std;
//堆满足两个要求：
//1、完全二叉树
//2、parent>child
void swap(int tree[],int i, int j) {
	int temp = tree[i];
	tree[i] = tree[j];
	tree[j] = temp;
}
//n:树结点数
//i:对数中第i个结点进行heapify,i从0开始
void heapify(int tree[], int n, int i){
	if (i >= n)
		return;
	int c1 = 2 * i + 1;
	int c2 = 2 * i + 2;
	int max = i;
	if (c1<n && tree[c1] > tree[max]) {
		max = c1;
	}
	if (c2<n && tree[c2] > tree[max]) {
		max = c2;
	}
	if (max != i) {
		swap(tree,max, i);
		heapify(tree, n, max);
	}
}
void buid_heap(int tree[], int n) {
	int last_node = n - 1;
	int parent = (last_node - 1) / 2;
	for (int i = parent; i >= 0; i--) {
		heapify(tree, n, i);
	}
}
void heap_sort(int tree[], int n) {
	buid_heap(tree, n);
	for (int i = n - 1; i >= 0; i--) {
		swap(tree, i, 0);
		heapify(tree, i, 0);
	}
}
int main() {
	int tree[] = { 2,5,3,1,10,4 };
	int n = 6;
	buid_sort(tree, n);
	for (int i = 0; i < n;i++){
		printf("%d\n", tree[i]);
	}

	return 0;
}