mainfunction.java

算法中经典问题

package sort;

import java.util.Date;
import java.util.Random;

public class mainFunction {
    public mainFunction() {
    }
    public static void main(String[] args)
    {
        final int size=1000000;
        sort sorting=new sort(size);
        long insertsortTime1=new Date().getTime();
  //     sorting.InsertSort();
        long insertsortTime2=new Date().getTime();
        long time=insertsortTime2-insertsortTime1;
        System.out.println("InsertSort need time:"+time);

        int[] matrix=new int[size];
        Random random=new Random();
        for( int i=1;i<matrix.length;i++ )
            matrix[i]=random.nextInt(size);

        insertsortTime1=new Date().getTime();
  //      sorting.BubbleSort(matrix);
        insertsortTime2=new Date().getTime();
        time=insertsortTime2-insertsortTime1;
        System.out.println("BubbleSort need time:"+time);

        insertsortTime1=new Date().getTime();
        sorting.QuickSort(matrix);
        insertsortTime2=new Date().getTime();
        time=insertsortTime2-insertsortTime1;
        System.out.println("QuickSort need time:"+time);

        matrix=new int[size];
        random=new Random();
        for( int i=1;i<matrix.length;i++ )
            matrix[i]=random.nextInt(size);
        insertsortTime1=new Date().getTime();
        sorting.HeapSort(matrix);
        insertsortTime2=new Date().getTime();
        time=insertsortTime2-insertsortTime1;
        System.out.println("HeapSort need time:"+time);
 //       for(int i=1;i<100;i++)
      //      System.out.print(matrix[i]+",");

    }
}