//往数组里插入一个数并排序
    /*
        准备一个新数组(插入一个数,长度比老数组大一),循环遍历老数组,将老数组的前面值赋值给新数组
        把新数插入到新数组中
        数组操作类排序,循环输出即可
     */
    public static void sortshuzu(int[] arrs,int t){
        int newlen = arrs.length;
        int[] newarrs = new int[newlen+1];

        for (int i = 0; i < arrs.length; i++) {
            newarrs[i] = arrs[i];
        }
        newarrs[newlen] = t;

        System.out.println("数组操作类升序输出:");
        Arrays.sort(newarrs);
        for(int a : newarrs){
            System.out.print(a+"  ");
        }
        System.out.println("\n冒牌排序降序输出:");
        int temp = 0;
        for (int i = 1; i < newarrs.length; i++) {
            for (int j = 0; j < newarrs.length-i; j++) {
                if(newarrs[j]<newarrs[j+1]){
                    temp = newarrs[j];
                    newarrs[j] = newarrs[j+1];
                    newarrs[j+1] = temp;
                }
            }
        }
        for(int a : newarrs){
            System.out.print(a+"  ");
        }
    }