快速排序、归并排序与选择排序平均时间之比较

#include<iostream>
#include<ctime>
#include<cstdlib>
using namespace std;


 void Merge(int Array[],int TempArray[],int low,int high,int mid);
 void MergeSort(int Array[],int TempArray[],int low,int high)
 {
      int mid;
	  if(low<high)
	  {
	       mid=(low+high)/2;
		   MergeSort(Array,TempArray,low,mid);
		   MergeSort(Array,TempArray,mid+1,high);
		   Merge(Array,TempArray,low,high,mid);
	  }
 }

 void Merge(int Array[],int TempArray[],int low,int high,int mid)
 {
      int i,j,index1,index2;
	  for(j=low;j<high;j++)
		  TempArray[j]=Array[j];
	  index1=low;
	  index2=mid+1;
	  i=low;
	  while(index1<=mid&&index2<=high)
	  {
	       if(TempArray[index1]<=TempArray[index2])
			   Array[i++]=TempArray[index2++];
		   else