heap.h

堆排序算法

#ifndef HEAP_H
#define HEAP_H

typedef int Type;
class Heap
{
private:
	Type * array;
	int MaxSize,Nel;
	//最大堆容量， nel 现在堆有的元素个数
	void Adjust(Type a[],int i,int n);
public:
	Heap(int MSize):MaxSize(MSize)
	{
		array = new Type[MaxSize + 1];
		Nel = 0;
	}
	~Heap()
	{
		delete []array;
	}

	bool Insert(Type item);
	//insert item
	bool DelMax(Type & item);
	//delete the maximum
};










#endif