java实现冒泡,选择,插入排序

java实现选择冒泡插入排序,以及他们的效率问题的研究.

public class 排序 {
    public static void main(String[] args) {
        int a[] = {100,99,98,87,65,54,21,12,1};

        System.out.println("排序前：");
        for (int i = 0; i < a.length; ++i) {
            System.out.print(a[i] + " ");
        }
        long start = System.nanoTime();


//        selectSort(a);;235664
        bubbleSort(a);

//        insertsort(a);

        System.out.println("\n");
        System.out.println("排序后：");
        for (int i = 0; i < a.length; ++i) {
            System.out.print(a[i] + " ");
        }
        System.out.println();
        long end = System.nanoTime();


        System.out.println(end - start);
    }

    //选择排序
    public static void selectSort(int arr[]) {
        int min = 0;
        int temp = 0;
        for (int i = 0; i < arr.length - 1; i++) {
            min = i;
            for (int j = i + 1; j < arr.length; j++) {
                if (arr[min] < arr[j]) {
                    min = j;
                }
            }
            if (min != i) {
                temp = arr[min];
                arr[min] = arr[i];
                arr[i] = temp;
            }
        }
    }

    //冒泡
    public static void bubbleSort(int a[]) {
        int temp = 0;
        for (int i = 0; i < a.length - 1; i++) {
            for (int j = i;j< a.length;j++){
                if (a[i]>a[j]){
                    temp = a[i];
                    a[i] = a[j];
                    a[j] = temp;
                }
            }
        }
    }
    //插入
    public static void insertsort(int a[]){
        for (int i = 1;i < a.length-1;i++){
            for (int j=i;j>0;j--){
                if (a[j]<a[j-1]){
                    int temp = a[j-1];
                    a[j-1] = a[j];
                    a[j] = temp;
                }
            }
        }
    }
}