排序

1、冒泡排序

    int [] arr=new int[]{89,77,99,100,19,23,55};
        
        for (int i = 0; i < arr.length -1; i++) {
            for (int j = 0; j < arr.length - i -1; j++) {
                    int n1=arr[j];
                    int n2=arr[j+1];
                    if(n1>n2) {
                        int temp=arr[j+1];
                        arr[j+1]=n1;
                        arr[j]=temp;
                    }
            }
        }
        System.out.println(Arrays.toString(arr));

2、选择排序

        int [] arr=new int[]{89,77,99,100,19,23,55};
        
        for (int i = 0; i < arr.length -1; i++) {
            for (int j = i+1; j < arr.length; j++) {
                if(arr[i] > arr[j]) {
                    int temp=arr[0];
                    arr[0]=arr[j];
                    arr[j]=temp;
                }
            }
        }
       System.out.println(Arrays.toString(arr));