java中的几种基础排序

import java.util.Random;
import java.util.Arrays;

public class Puppy {

    public static void main(String args[]) {

//排序
        int[] a = {25, 24, 12, 76, 8, 101, 90, 28};

        //快速排序
        Arrays.sort(a);
       for (int i = 0; i < a.length; ++i) {

           System.out.println("a[i]=" + a[i]);

       }
//冒泡排序
       for (int i = 0; i < a.length; ++i) {
            for(int j = 0; j < a.length-i-1; ++j){
          if(a[j]>a[j+1]){
           int temp = a[j];
            a[j] = a[j+1];
            a[j+1] = temp;
           }
                       
            }

    }
       System.out.println(Arrays.toString(a));
//乱序
        for (int i = 0; i < a.length; ++i) {

            Random rand = new Random();
            int b = rand.nextInt(a.length);
            int temp = a[i];
            a[i] = a[b];
            a[b] = temp;
        }
        System.out.println("乱序结果是");
        printArr(a);
    }

    public static void printArr(int[] a) {

        for (int eachArr : a) {

            System.out.print(eachArr + ",");

        }
        System.out.println();
    }
}