package Mysort.Test;
import java.io.*;
import java.util.*;
import Mysort.*;
public class test
{
	public static void main(String[] args)  throws IOException
	{
        int sum, i, j=0, n=0,array_length;
    	char k = '3';
    	boolean flag=true;
    	M x;
    	j_sort xsort;
		System.out.println("                                  java實驗                               ");		
		System.out.println("                            自動測試排序算法性能                         ");     
		do
		{
			if(flag)
			{
				System.out.println("-------------------------------------------------------------------------------");
				System.out.print("請輸入數(shù)組的規(guī)模大小:");
			}
			else 
			System.out.println("已經(jīng)退出！謝謝使用！");
			if (k != '3') break; //控制是否退出
			do
			{
				array_length=0;
				j=System.in.read();
				while((j!=32)&&(j!=13))
				{
					array_length=array_length*10+j-48;
					j=System.in.read();
				}
			}while(j!=13);
			System.in.read();   //消除回車鍵
			int[] a = new int[array_length];
    	    int[] b = new int[array_length];
			System.out.print("請輸入數(shù)組元素(不多于100個元素,如10 9 8):");
			do   //輸入數(shù)組各元素的值          
			{
				sum = 0;
				j = System.in.read();
				while ((j!=32)&&(j!=13))     //空格的判斷和回車的判斷
				{
					sum = sum * 10 + j - 48;   //轉(zhuǎn)化為整數(shù)
					j = System.in.read();
				}
				a[n] = sum;
				n++;
			} while (j != 13);       //回車的判斷
			//n--;                //數(shù)組實際個數(shù)
			System.in.read();   //消除回車鍵
			do   //排序
			{
				System.out.print("選擇(0-選擇法 1-冒泡法 2-選擇法 3－重輸數(shù)組 按其他鍵退出！）：");
				k = (char)System.in.read();//選擇哪種排序
				System.in.read();   //消除回車鍵
				if ((k != '0') && (k != '1') && (k != '2')) break;//控制是否排序
				 
				for (int s = 0; s < n; s++) b[s] = a[s]; //保存數(shù)組a到數(shù)組b
				switch(k)
				{
					case '0':xsort=new xuanzhe_sort(a,n);
					         x=xsort.dosort();
 					         xsort.output();
 					         System.out.println(x); 
					         break;
				 	case '1':xsort=new maopao_sort(a,n);
					         x=xsort.dosort();
					         xsort.output();
					         System.out.println(x); 
					         break;
					case '2':xsort=new charu_sort(a,n);
					         x=xsort.dosort();
					         xsort.output();
					         System.out.println(x);
					         break;		
				}
				for (int s = 0; s < n; s++) a[s] = b[s]; //恢復(fù)數(shù)組a原先的內(nèi)容
			} while (true);
			if(k!='3')flag = false;
			System.in.read();//消除回車鍵
		} while (true);

	}
}