堆排序示例:对n个整数进行排序.

堆排序是一种比较高效的算法.虽然在大规模排序时不及快排,但是这个算法较容易实现,不易错(因为没有用到递归),一般规模的排序还是效果不错的.

以下是示例代码:

#include<iostream>
using namespace std;

void heapsort(int num[], int n);	//func decl.

int main(void)
{
	int n, *num;	//define var.
	while(cin >> n) {
		num = new int[n];	//new spaces.
		
		/*input data.*/
		for(int i = 0; i < n; ++i)
			cin >> num[i];
		/*sorting.*/
		heapsort(num, n);

		/*output data.*/
		for(int i = 0; i < n; ++i)
			cout << ' ' << num[i];
		cout << endl;

		delete[] num;	//delete spaces.
	}
	return 0;
}//main.

void HeapAdjust(int num[], int n)
{
	int m = n/2; //num of nodes that have child nodes.
	for(int i = m; i >= 1; --i)
	{
		if(2*i < n && num[i-1] < num[2*i]) {
			int t = num[i-1];
			num[i-1] = num[2*i];
			num[2*i] = t;
		}
		if(num[i-1] < num[2*i-1]) {
			int t = num[i-1];
			num[i-1] = num[2*