数组冒泡排序

合集 - 编程思维方式(13)

1.编写循环小案例2023-09-292.二分查找2023-09-29

3.数组冒泡排序2023-09-29

4.数组插入排序2023-09-295.向有序数组插入数据，数组依然是有序的2023-09-296.链表冒泡排序2023-09-297.链表插入排序2023-09-298.使用数组模拟集合2023-09-299.模拟链表2023-09-2910.使用数组模拟队列和栈2023-09-2911.使用链表模拟队列和栈2023-09-2912.使用数组操作实体类2023-09-2913.使用链表操作实体类2023-09-29

收起

• 第1次推导

public class test {
    public static void main(String[] args) {
        int[] ints = {6, 5, 9, 5};
        int tmp;
 
        if(ints[0]>ints[1]){
            tmp = ints[0];
            ints[0] = ints[1];
            ints[1] = tmp;
        }
        if(ints[1]>ints[2]){
            tmp = ints[1];
            ints[1] = ints[2];
            ints[2] = tmp;
        }
        if(ints[2]>ints[3]){
            tmp = ints[2];
            ints[2] = ints[3];
            ints[3] = tmp;
        }
        System.out.println(ints[0] + "," + ints[1] + "," + ints[2] + "," + ints[3]);
 
        if(ints[0]>ints[1]){
            tmp = ints[0];
            ints[0] = ints[1];
            ints[1] = tmp;
        }
        if(ints[1]>ints[2]){
            tmp = ints[1];
            ints[1] = ints[2];
            ints[2] = tmp;
        }
        System.out.println(ints[0] + "," + ints[1] + "," + ints[2] + "," + ints[3]);
 
        if(ints[0]>ints[1]){
            tmp = ints[0];
            ints[0] = ints[1];
            ints[1] = tmp;
        }
        System.out.println(ints[0] + "," + ints[1] + "," + ints[2] + "," + ints[3]);
 
    }
}

• 第2次推导

public class test {
    public static void main(String[] args) {
        int[] ints = {6, 5, 9, 5};
        int tmp;
 
        int i=0;
        int j=1;
        for(int a = 3; a>0; a--){
            if(ints[i]>ints[j]){
                tmp = ints[i];
                ints[i] = ints[j];
                ints[j] = tmp;
            }
            i++;
            j++;
        }
        System.out.println(ints[0] + "," + ints[1] + "," + ints[2] + "," + ints[3]);
 
        i=0;
        j=1;
        for(int a = 2; a>0; a--){
            if(ints[i]>ints[j]){
                tmp = ints[i];
                ints[i] = ints[j];
                ints[j] = tmp;
            }
            i++;
            j++;
        }
        System.out.println(ints[0] + "," + ints[1] + "," + ints[2] + "," + ints[3]);
 
        i=0;
        j=1;
        for(int a = 1; a>0; a--){
            if(ints[i]>ints[j]){
                tmp = ints[i];
                ints[i] = ints[j];
                ints[j] = tmp;
            }
            i++;
            j++;
        }
        System.out.println(ints[0] + "," + ints[1] + "," + ints[2] + "," + ints[3]);
 
    }
}

• 最终完善

public class test {
    public static void main(String[] args) {
        int[] ints = {6, 5, 9, 2, 5, 6,7,3};
        for(int b = ints.length-1; b>0; b--){
            int tmp;
            int i=0;
            for(int a = b; a>0; a--){
                if(ints[i]>ints[i+1]){
                    tmp = ints[i];
                    ints[i] = ints[i+1];
                    ints[i+1] = tmp;
                }
                i++;
            }
        }
        for (int anInt : ints) {
            System.out.print(anInt + ",");
        }
 
    }
}