java冒泡排序的两种方法

在这里插入代码片
public class Test {

    public static void sortNum(int[] arr) {
        int count = 0;
        int t = arr.length-1;
        for (int i = 0; i < t; i++) {
            // 前面比后面大，则进行交换
                int a = arr[i];
                int b = arr[i+1];
                if(a > b){
                int temp =  arr[i+1];
                arr[i+1] = arr[i] ;
                arr[i] = temp;
            }
            count++;

            if(i == t-1){
                i = -1;
                t--;
            }
        }
        //执行 45 次
        System.out.println("比较" + count + "次");
    }
    public static void sortNum2(int[] arr){
        int count = 0;
        int i = arr.length/2;
        //执行 50 次
        for ( ; i < arr.length ; i++){
            for(int j = 0 ; j < arr.length ; j++){
                count++;
                int q = arr[i];
                int w = arr[j];
                if(q > w){
                    int temp =  arr[j];
                    arr[j] = arr[i];
                    arr[i] =temp;
                }
            }
            for(int k = arr.length-1 ; k > arr.length ; k--){
                count++;
                int q = arr[i];
                int w = arr[k];
                if(q < w){
                    int temp =  arr[k];
                    arr[k] = arr[i];
                    arr[i] =temp;
                }
            }
        }
        //执行 50 次
        System.out.println("比较" + count + "次");
    }
    public static void main(String[] args) {
        int[] arr = new int[]{1,5,2,3,6,9,8,4,7,10};
        sortNum(arr);
        sortNum2(arr);
    }

}

![执行结果](https://img-blog.csdnimg.cn/f989cfda2fa14220bbcaf632b583cb7f.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBA5L2b5YmN5o-S56en,size_20,color_FFFFFF,t_70,g_se,x_16#pic_center)