经典六大排序算法（冒泡排序、选择排序、插入排序、希尔排序、归并排序、快速排序）

import java.util.Arrays;

public class Sort {
   
    public static void main(String[] args) {
   
        Integer[] a = {
   8,6,4,945,56,95,44,1,64,645,6,74,65,65,77,33,6,4,56};
        quickSort(a,0,a.length-1);
//        bubbleSort(a);
        shellSort(a);
//        insertSort(a);
//        selectInsert(a);`
        System.out.println(Arrays.toString(a));
    }

    /**
     * 冒泡排序
     * @param a
     */
    public static void bubbleSort(Comparable[] a){
   
        for (int i = 0; i < a.length-1; i++) {
   
            for (int j = 0; j < a.length -i -1; j++) {
   
                if(a[j].compareTo(a[j+1])>