冒泡排序

package arrays;

public class demo11 {
    public static void main(String[] args) {
        int[] arr=new int[]{1,6,8,9,3,10,256,45,12};
        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]){
                  int temp=arr[j];
                  arr[j]=arr[j+1];
                  arr[j+1]=temp;
              }
                
            }

        }

    }
}