q_and_m.h

归并和快速算法比较

#ifndef Q_and_MH
#define Q_and_MH
//---归并排序----------------------------------------------------------------
void Merge(int A[], int T[], int low, int mid, int high);
void MergePass(int A[], int T[],int length, int n);
void MergeSort(int A[], int n);
//---归并递归----------------------------------------------------------------
void MergeR(int A[], int T[], int low, int mid, int high);
void MergeSortR(int A[], int T[], int low, int high);
//---快速排序----------------------------------------------------------------
int Split(int A[], int low, int high);//一趟排序，返回锁定位置
void QuickSort(int A[], int low, int high);
//---------------------------------------------------------------------------
#endif