heap.h

演示了堆排序的算法逻辑

// Heap.h: interface for the Heap class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_HEAP_H__0D48E6F6_ADEE_4FD5_AB6D_E6C65CF9D24A__INCLUDED_)
#define AFX_HEAP_H__0D48E6F6_ADEE_4FD5_AB6D_E6C65CF9D24A__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
/*我的代码*/
#include <string>
using namespace std;
#define N 17

struct HeapNode
{
	CString key;
	CPoint Locate;
	CPoint Parent;
	bool style;//0 linstyle: PS_SOLID color:RGB(0,116,167)
			//1 linstyle: PS_DOT color:RGB(230,117,219)
	HeapNode(CPoint l,CPoint p)
	{
		Locate = l;
		Parent = p;
	}
	HeapNode()
	{
		key = "";
		Locate = Parent = CPoint(-1,-1);
	}
};

/*定义结束*/

class Heap  
{	
public:
	int n ;
	HeapNode Heapnode[N];
	Heap();
	void reset(CRect r);
	virtual ~Heap();
	void SetNode(CRect r);

};

#endif // !defined(AFX_HEAP_H__0D48E6F6_ADEE_4FD5_AB6D_E6C65CF9D24A__INCLUDED_)