冒泡排序

        boolean sorted = false;
        int[] arr = new int[]{34,65,32,12,2,3,5,1,2};
        int arrIndex = arr.length-1;
        while ( !sorted ){
            sorted = true;
            for ( int i = 0;i < arrIndex; i++ ){
                sorted = false;
                if ( arr[i] > arr[i+1] ){
                    int a = arr[i];
                    arr[i] = arr[i+1];
                    arr[i+1] = a;
                }
            }
            arrIndex -= 1;
        }
        for ( int i = 0; i < arr.length-1 ; i++  ){
            System.out.println(arr[i]);
        }```



重在理解此排序算法的思想，不要限于语言的影响