自定义方法排序

package com.hqyj.javacode.methobs;

import java.util.Arrays;

public class HomeWork {
    public static void main(String[] args) {
        int arr1[]=randome(10,10);
        System.out.println(Arrays.toString(arr1));
        int arr2[]=bubbling(arr1);
        System.out.println(Arrays.toString(arr2));

    }
    public static int[] randome(int length, int range){
         int[]arr=new int[length];
        for (int i = 0; i <arr.length ; i++) {
            arr[i]=(int) (Math.random()*range);

        }
        return  arr;
    }
    public  static  int[] bubbling(int a[]){
        int t;
        for (int i = 0; i <a.length-1; i++) {
            for (int j = 0; j < a.length-i-1; j++) {
                if (a[j]>a[j+1]){
                    t=a[j];
                    a[j]=a[j+1];
                    a[j+1]=t;
                }

            }

        }
        return  a;
    }
}