#include <cstdlib>
#include <iostream>
#include "MergeSortL.cpp"
#include "InsertionSort.cpp"

using namespace std;

int main(int argc, char *argv[])
{
	  int a[11]={50,10,25,30,15,70,35,55,60,33,40};
	  
	  int mark,j,len=11;         
	  cout<<endl<<"輸入數(shù)組的大小:";
		cin>>len;
//		cout<<"輸入數(shù)組元素:";
//		for(int i=0;i<len;i++)
//	    cin>>a[i];                                     
    for(int i=0;i<len;i++)
    {
       a[i]=(int)rand();
	      cout<<a[i]<<" ";
			}
			cin>>j;
/*		int * Link = new int[len+1];  
	  for(int i=0;i<=len;i++)
	    Link[i]=0;
	    
	  mark=MergeSortL(a,Link,0,len-1);
	  cout<<"原輸入的數(shù)組為:";
	  for(int i=0;i<len;i++)
	    cout<<a[i]<<" ";
		cout<<endl;
		 
		cout<<"數(shù)組對應的靜態(tài)Link鏈表為"<<mark<<" ";	                                      
	  for(int i=0;i<len;i++)
	    cout<<Link[i]<<" ";
	  cout<<endl<<"排序后的數(shù)組為:";

	  for(int i=0;i<len;i++)
	  {		
	    cout<<a[mark]<<" ";
	    mark=Link[mark];
		}  
		cout<<endl;
    system("PAUSE");  */
    return EXIT_SUCCESS;
}