关于堆

实现一个最大堆数据结构

template<typename Item>
class MaxHeap
{
private:
	Item* data;
	int count;
	int capacity;
	void shiftUp(int k)
	{
		while (k > 1 && data[k / 2] < data[k])
		{
			swap(data[k / 2], data[k]);
			k /= 2;
		}
	}
	void shiftDown(int k)
	{
		while (2*k <= count)
		{
			int j = 2 * k;//在此轮循环中，data[k]和data[j]交换位置
			if (j + 1 <= count && data[j + 1] > data[j])
				j = j + 1;
			if (data[k] >= data[j])
				break;
			swap(data[k], data[j]);
			k = j;
		}
	}
public:
	MaxHeap(int capacity)
	{
		data = new Item[capacity + 1];
		count = 0;
		this->capacity = capacity;
	}
	~MaxHeap()
	{
		delete[] data;
	}
	int size()
	{
		return count;
	}
	bool isempty()
	{
		return count == 0;
	}
	void insert(Item item)
	{
		assert(count + 1 <= capacity);
		data[count + 1] = item;
		++count;
		shiftUp(count);
	}
	Item extractMax()
	{
		assert(count > 0);
		Item ret = data[1];
		swap(data[1], data[count]);
		count--;
		shiftDown(1);
		return ret;
	}
};

堆排序

template<typename T>
void heapsort1(T arr[], int n)
{
	MaxHeap<T> maxheap = new MaxHeap<T>(n);
	for (int i = 0; i < n; i++)
		maxheap.insert(arr[i]);
	for (int i = n - 1; i >= 0; i--)
		arr[i] = maxheap.extractMax();
}