冒泡排序Java

//冒泡排序
public class OnePulsPro {
    public static void main(String[] args) {
        int[]arr={55,99,44,33,551,15,9,2,7,952};
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j ) {
                if (arr[j]>arr[j+1]){
                    int num=arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=num;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}