java实现冒泡排序

package com.test.suanfa;

public class Maopao {
    public static void main(String[] args) {
        Maopao sort = new Maopao();
        int[] arr= new int[]{7,22,11,5,400,99,20,22,5};
        sort.sort(arr);
        for(int i : arr)
            System.out.print(i+",");
        }

    
    public void sort(int[] targetArr){//小到大的排序
        int temp = 0;
        for(int i = 0;i<targetArr.length;i++){
            for(int j = i+1;j<targetArr.length;j++){
                System.out.print(targetArr[i]+"---------"+targetArr[j]+"``````比较转换之后`````");
                if(targetArr[i]>targetArr[j]){
                    temp = targetArr[i];
                    targetArr[i] = targetArr[j];
                    targetArr[j] = temp;    
                }
                for(int k : targetArr)
                    System.out.print(k+",");
                System.out.println();
            }
            
        }
    }
}