Java——冒泡排序

public class search {
    public static void main(String[] args) {
        int arr[] = {12,4,55,62,32,56};
        sort(arr);
    }

    // 反转【冒泡排序——升序】
    public static void sort(int arr[]){
        int tmp;
        for (int i = 0; i < arr.length-1; i++) {
            if (arr[i] > arr[i+1]){
                tmp = arr[i];
                arr[i] = arr[i+1];
                arr[i+1] = tmp;
            }
            System.out.print(arr[i]+"，");
        }
    }
}