一个堆排序的实现

void AdjustHeapEx(int* a, int nCurrentIndex, int size)
{
	if (nCurrentIndex >= size)
		return;

	// 先调整他的子节点
	AdjustHeapEx(a, 2 * nCurrentIndex, size);
	AdjustHeapEx(a, 2 * nCurrentIndex + 1, size);

	int nLeftChild = 2 * nCurrentIndex;
	int nRightChild = 2 * nCurrentIndex + 1; 
	int nMax = nCurrentIndex;
	if (nLeftChild <= size && a[nLeftChild] > a[nMax])
	{
		//
		nMax = nLeftChild;
	}
	if (nRightChild <= size && a[nRightChild] > a[nMax])
	{
		//
		nMax = nRightChild;
	}
	if (nMax != nCurrentIndex)
	{
		swap(a[nCurrentIndex], a[nMax]);
	}
}

// 堆是完全二叉树，分大根堆和小根堆
void BuildHeapEx(int* a, int size)
{
	// 从第一个节点开始向后调整
	for (int i = 1; i <= size / 2; i++)
	{
		AdjustHeapEx(a, i, size);
	}
}

void HeapSortEx(int* a, int size)
{
	BuildHeapEx(a, size);
	for (int j = 1; j <= size; j++)
	{
		cout << a[j] << " ";
	}
	cout << endl;

	swap(a[1], a[size]);
	while (size-- > 1)
	{
		AdjustHeapEx(a, 1, size);
		swap(a[1], a[size]);
	}
}

int _tmain(int argc, _TCHAR* argv[])
{
	// 这种排序必须从第一个元素开始排序
	int a[100] = {0, 15, 23, 1, 557, 43, 26, 2, 21, 895, 16};
	int size = 10;

	HeapSortEx(a, size);

	for (int i = 1; i <= size; i++)
	{
		cout << a[i] << " ";
	}
	cout << endl;

	return 0;
}

这个算法利用了大顶堆的数据结构，进行循环递归排序