冒泡排序

分析

image-20210324151736927

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
package 算法;

public class 冒泡排序 {
    public static void main(String[] args) {
        int[] arr = new int[]{3,9,-1,10,20};
        int len = arr.length;
        boolean flag = true;
        for (int i = 0; i < len-1; i++) {
            flag = true;
            for (int j = i+1; j < len-1-i; j++) {
                if(arr[i]>arr[j]){
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                    flag =false;
                }
            }
            if(flag){
                break;
            }
        }
        for (int i : arr) {
            System.out.println(i);
        }
    }
}