排序

public static void main(String[] args) {
        int [] a=new int[]{11,2,35,48,5,64};
        int max = a[0];   //假设的值 ,是数组任意值
        int min = a[0];
        //快捷键  fori  回车
        for (int i = 0; i <a.length ; i++) { //取出最大值
            if(a[i]>max){
                max = a[i];
            }
        }
        for (int i = 0; i <a.length ; i++) { //取出最小值
            if(a[i]<min){
                min = a[i];
            }
        }
        System.out.println(“从小到大排序”);
        //从小到大排序
        for (int i = 0; i <a.length-1 ; i++) {
            for (int j = i+1; j <a.length ; j++) {
                if (a[i]>a[j]){
                    int temp=a[i];
                    a[i]=a[j];
                    a[j]=temp;
                }
            }
        }
        for (int num:a) {
            System.out.println(num);
        }
        System.out.println(“从大到小排序”);
        //从大到小排序
        for (int i = 0; i <a.length-1 ; i++) {
            for (int j = i+1; j <a.length ; j++) {
                if (a[i]<a[j]){
                    int temp=a[i];
                    a[i]=a[j];
                    a[j]=temp;
                }
            }
        }
        for (int num:a) {
            System.out.println(num);
        }
        System.out.println(“最大值”);
        System.out.println(max);
        System.out.println(“最小值”);
        System.out.println(min);
    }