略知Ⅶ

 选择、插入、气泡排序

private static void swap(int[] number, int i, int j)
    {
        int t;
        t = number[i];
        number[i] = number[j];
        number[j] = t;
    }
    public static void selectionSort(int[] number)
    {
        for (int i = 0; i < number.length - 1; i++)
        {
            int m = i;
            for (int j = i + 1; j < number.length; j++)
                if (number[j] < number[m])
                    m = j;
            if (i != m)
                swap(number, i, m);
        }
    }
    public static void injectionSort(int[] number)
    {
        for (int j = 1; j < number.length; j++)
        {
            int tmp = number[j];
            int i = j - 1;
            while (tmp < number[i])
            {
                number[i + 1] = number[i];
                i--;
                if (i == -1)
                    break;
            }
            number[i + 1] = tmp;
        }
    }
    public static void bubbleSort(int[] number)
    {
        boolean flag = true;
        for (int i = 0; i < number.length - 1 && flag; i++)
        {
            flag = false;
            for (int j = 0; j < number.length - i - 1; j++)
            {
                if (number[j + 1] < number[j])
                {
                    swap(number, j + 1, j);
                    flag = true;
                }
            }
        }
    }