java 数组动态接收和冒泡排序

import java.util.Scanner;

public class Code {
    public static void main(String[] args) {
        no1();
    }
    static  void no1(){
        int[]nums=input();
        System.out.println("排序之前");
        show(nums);
        System.out.println();
        System.out.println("排序之后：");
        Px(nums);
    }
    /** 动态接收*/
    static int[] input(){
        int[] nums=new int[5];
        Scanner sc=new Scanner(System.in);
        for (int i = 0; i < nums.length; i++) {
            System.out.printf("请输入第%d个值:",i+1);
            nums[i]=sc.nextInt();
        }
        return nums;
    }
    /** 未排序之前*/
    static void show(int[]nums){
        for(int i:nums){
            System.out.print(i+" ");
        }
    }
    /** 排序之后*/
    static void Px(int[] nums){
        for (int i = 0; i < nums.length-1; i++) {
            for (int j = 0; j <nums.length-i-1 ; j++) {
                if(nums[j]>nums[j+1]){
                    int temp=nums[j];
                    nums[j]=nums[j+1];
                    nums[j+1]=temp;
                }
            }
        }
       for(int i:nums){
           System.out.print(i+" ");
       }
    }
}