数组--冒泡排序

 //冒泡排序

int[] arr={24,69,80, 89,57,13};
        int min=0;

        for (int i = 0; i < arr.length-1; i++) {
            for (int j = 0; j < arr.length-1-i ; j++) {
                if(arr[j]>arr[j+1]){
                    min=arr[j+1];
                    arr[j+1]=arr[j];
                    arr[j]=min;
                }
            }
        }
        for (int k = 0; k < arr.length; k++) {
            System.out.print(arr[k]+" ");//13 24 57 69 80 89
        }