简单排序

public static void bubbleSort(int[] a){
    for(int outer = a.length - 1; outer > 1; outer--)
        for(int inner = 0; inner < outer ;inner++)
            if(a[inner] > a[inner + 1])
                swap(a, inner, inner+1);
}

public static void selectSort(int[] a){
    int min;
    for(int i = 0; i < a.length - 1; i++){
        min = i;
        for(int j = i + 1; j < a.length; j++)
            if(a[j] < a[min]) min = j;
        swap(a, i, min);
    }
}

public static void insertSort(int[] a){
    for(int i = 1; i < a.length; i++){
        int j = i, temp = a[i];
        while(j > 0 && a[j - 1] >= temp){
            a[j] = a[j - 1];j--;
        }
        a[j] = temp;
    }
}