冒泡排序o

package 常见排序算法;


public class BuddleSort {

    public static void doBuddle(int[] arr) {

        for (int i = 0; i arr[j+1]){
                   int tmp = arr[j];
                   arr[j] = arr[j+1];     //
                   arr[j+1] = tmp;
               }

            }
        }

    }


    public static void main(String[] args) {
        int[] arr = {4, 2, 1, 10, 3};
        doBuddle(arr);
        for (int i : arr) {
            System.out.println("排序后元素" + i);
        }
    }


}