堆排序

/*堆排序思想：先创建堆，然后就把首数字放到未排好数字的最末尾，在调整堆
*/

#include <iostream>
#include <cstdio>
using namespace std;

//调整堆
void HeapAdjust(int *a, int ¤t, int low, int high)
{
	int large;
	large = 2 * low + 1; //左儿子
	while (large <= high) {
		if (large < high && a[large] < a[large+1])
			large++;
		if (current >= a[large])
			break;
		else {
			//继续调整堆
			a[low] = a[large];
			low = large;
			large = 2 * low + 1;
		}
	}
	a[low] = current;
}

void build_heap(int *a, int size)
{
	int current;
	//建堆，从(size - 2)/2开始 到0
	for (int low = (size - 2)/2; low >= 0; low--)
	{
		//记录当前值
		current = a[low];
		HeapAdjust(a, current, low, size - 1);
	}
}
void HeapSort(int *a, int size)
{
	int current;
	//建立堆
	build_heap(a, size);
	//输出每一次堆变化的值
	cout << a[0];
	for (int j = 1; j < size; j++)
		cout << " " << a[j];
	cout << endl;
	
	for (int i = size - 1; i > 0; i--)
	{
		current = a[i];
		a[i] = a[0];
		HeapAdjust(a, current, 0, i - 1);

		//输出每一次堆变化的值
		cout << a[0];
		for (int j = 1; j < size; j++)
		cout << " " << a[j];
		cout << endl;
	}
}

int main()
{
	int a[100000];
	int n;
	int size;
	while (scanf("%d", &n) != EOF) {
		size = n;

		for (int i = 0; i < n; i++)
			cin >> a[i];

		HeapSort(a, size);

	}
	system("pause");
	return 0;
	
}