冒泡排序和选择排序

public static void main(String[] args) {
        int [] ts = {0,3,4,7,1,9,2,5,6,8};
        
        for(int i = 0; i<ts.length; i++){
            for(int j = i+1; j<ts.length; j++){
                if(ts[i]>ts[j]){
                    int i1 = ts[i];
                    int i2 = ts[j];
                    ts[i] = i1;
                    ts[j] = i2;
                }
            }
        }
        for(int s : ts){
            System.out.print(s);
        }
    }

public static void main(String[] args) {
        
        int [] t = {0,3,4,7,1,9,2,5,6,8};
        
        int minIndex = 0;
        for(int i = 0; i<t.length; i++){
            minIndex = i;
            for(int j = i+1; j<t.length; j++){
                if(t[minIndex]>t[j]){
                    minIndex = j;
                    System.out.println(minIndex);
                }
            }
            if(minIndex != i){
                int i1 = t[i];
                int i2 = t[minIndex];
                t[i] = i2;
                t[minIndex] = i1;
            }
        }
        
        for(int s : t){
            System.out.print(s);
        }
        
    }