冒泡排序

import java.util.Arrays;

public class Main {
    
    public static void bubbleSort(int[] array) {
        
        if(array == null || array.length == 0)
            return;
        for(int i = 0; i < array.length; i++) {
            
            for(int j = array.length - 1; j >i; j--) {
                
                if(array[j] < array[j - 1]) {
                    
                    int temp = array[j];
                    array[j] = array[j - 1];
                    array[j - 1] = temp;
                }
            }
        }
    }
    public static void main(String[] args) {
        
        int[] a = randomArray(10);
        System.out.println(Arrays.toString(a));
        bubbleSort(a);
        System.out.println(Arrays.toString(a));
    }
    public static int[] randomArray(int n) {
        
        if(n <= 0)
            return null;
        int[] a = new int[n];
        for(int i = 0; i < n; i++) {
            
            a[i] = (int)(Math.random() * 1000);
        }
        return a;
    }
}