排序算法之选择排序与冒泡排序

public class 选择排序 {
    public static void main(String[] args) {
        int n=10;
        int[] t = {5, 1, 3, 4, 5, 9, 6, 12, 34, 20};
        for (int i = 0; i < n - 1; i++) {
            int min=i;
            for (int j = i + 1; j < n; j++) {
                if (t[j] < t[min]) {
                    min = j;
                }
            }
                if (min != i) {
                    int temp = t[min];
                    t[min] = t[i];
                    t[i] = temp;
                }
        }
    }
}

public class 冒泡排序 {
    public static void main(String[] args) {
        int n=10;
        int[] t = {1, 10, 13, 9, 6, 2, 5, 4, 3, 19};
        for (int i = 0; i < n - 1; i++) {
            for (int j = i + 1; j < n; j++) {
                if (t[i] > t[j]) {
                    int temp = t[i];
                    t[i] = t[j];
                    t[j] = temp;
                }
            }
        }
    }
}