// Compositor.h: interface for the CTaxis class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_COMPOSITOR_H__8CE79729_08FC_41C1_A7D7_EDA42724E7DA__INCLUDED_)
#define AFX_COMPOSITOR_H__8CE79729_08FC_41C1_A7D7_EDA42724E7DA__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include "TypeDef.h"

//排序類
class CTaxis  
{
public:
	CTaxis(STUDINFO pStudInfo[],UINT uiTaxisSort);//uiTaxisMethod為排序方法，uiTaxisSort為排序類別，nTaxisSequence為排序順序
	virtual ~CTaxis();

private:
	void StudInfoJ2I(UINT i,UINT j);//交換學生信息

	void QuickTaxis();//快速排序
	UINT Partition(STUDINFO L[],UINT uiLow,UINT uiHigh);//交換順序表L中子表L.r[low...high]的記錄，使書樞軸記錄到位，并返回其所在位置，此時在它之前（后）的記錄均不大（小）于它,返回樞軸位置
	void QuickSort(STUDINFO L[],int nLow,int nHigh);

	void HeapTaxis(); //堆排序,用于記錄較大的文件
	void HeapAdjust(STUDINFO L[],int s,int m);

	void MergeTaxis();//歸并排序
	void MergeSort(STUDINFO SourceL[], STUDINFO DestL[],int s,int t);
	void Merge(STUDINFO SourceL[],STUDINFO DestL[],int i,int m,int n);//將無序的SR[i...m]和SR[m+1...n]歸并為有序的TR[i...n]
	
private:			
	STUDINFO* pStudInfo;//學生信息
	UINT uiTaxisSort;   //排序類別
};

#endif // !defined(AFX_COMPOSITOR_H__8CE79729_08FC_41C1_A7D7_EDA42724E7DA__INCLUDED_)