public static void insertSort(int[] array) {
        for (int i = 1; i < array.length; i++) {
            int tmp = array[i];
            int j = i-1;
            for (; j >= 0 ; j--) {
                if(array[j] > tmp) {
                    array[j+1] = array[j];
                }else {
                    //array[j+1] = tmp;  只要j回退的時(shí)候，遇到了 比tmp小的元素就結(jié)束這次的比較
                    break;
                }
            }
            //j回退到了 小于0 的地方
            array[j+1] = tmp;
        }
    }

 public static void createHeap(int[] array) {
     for (int parent = (array.length - 1 - 1) / 2; parent > 0; parent--) {//設(shè)置出父親節(jié)點(diǎn)
            shiftDown(array, parent, array.length);//
        }
    }
    public static void shiftDown(int[] array, int parent, int len) {
        int child = 2 * parent + 1;//設(shè)置出子節(jié)點(diǎn)
        while (child < len) {
            if (child + 1 < len && array[child] < array[child + 1]) {
                child++;//以防有兩個(gè)子節(jié)點(diǎn) 找出兩個(gè)子節(jié)點(diǎn)最大一位
            }
            if (array[child] > array[parent]) {
            swap(array, parent, child);//交換父親節(jié)點(diǎn)和子節(jié)點(diǎn)
            parent = child;//從新設(shè)置父親節(jié)點(diǎn)
            child = 2*parent+1;
        }else{
            break;
        }
    }
    }
    public static void heapSort(int[] array) {//
        createHeap(  array);
        int end  = array.length-1;//每次交換完最后一位元素減一位
        while(end > 0){
            swap(array,0,end);
            shiftDown(array,0, array.length-1);//這個(gè)循環(huán)里 向下轉(zhuǎn)型
            end--;
        }
    }

 public static void quick(int[] array,int left,int right) {
      if( left >= right) {//判斷遞歸條件 不滿足退出
          return;
      }
        int pivot =  partition( array,left,right);//找出基準(zhǔn)值
        quick( array, left, pivot-1);//左側(cè)進(jìn)行遞歸
        quick( array, pivot+1 ,right);//右側(cè)進(jìn)行遞歸
    }
    private static int partition(int[] array,int start,int end) {
            int tmp = array[start];
            while(start< end){// 
                while(start< end &&array[end] >  tmp){//末尾值比tmp大時(shí) 將末尾下標(biāo)減減
                    end--;
                }
               array[start] = array[end];//在右側(cè)遇到比tmp小的元素 進(jìn)行交換
              while(start< end && array[start] < tmp ){//先從頭部進(jìn)行比較 比tmp小時(shí)交換
                  start++;
              }
              array[end] = array[start];
            }
            array[end] = tmp;
            return end;
    }
    public static void quickSort(int[] array) {
       quick(array,0, array.length-1);
        }
}
}

public static int[] mergeArray(int[] array1,int[] array2) {
        //注意判斷參數(shù)
        int [] tmp = new int[array1.length + array2.length];
        int i = 0;
        int s1 = 0;
        int e1 = array1.length-1;
        int s2 = 0;
        int e2 = array2.length-1;
        while( s1<e1 && s2<e2){
            if(array1[s1] < array2[s2]){
                tmp[i++] = array1[s1++];
 
            }
            if(array1[s1] > array2[s2]){
                tmp[i++] = array2[s2++];
            }
        }
       while( s1<= e1){
           tmp[i++] = array1[s1++];
       }
       while( s2<= e2){
           tmp[i++] = array2[s2++];
       }
        return tmp;

 public static void mergeSort1(int[] array) {
 
 mergeSortInternal(array,0,array.length-1) ;
 
 
}
private static void mergeSortInternal(int[] array,int low,int high) {
           if(low > high){
           return ;
           }
   int mid  = (low +(high-low))/2;//找到數(shù)組的中間位置 分為左右兩部分
    mergeSortInternal( array, low,mid-1 );// 將左邊部分進(jìn)行遞歸排序
   mergeSortInternal( array, mid+1,high );// 將右邊部分進(jìn)行遞歸排序  
    merge(array,low,mid,high);// 將兩部分進(jìn)行合并
 
}
private static void merge(int[] array,int low,int mid,int high) {
         int [] tmp = new int[array.length];//創(chuàng)建一個(gè)新的數(shù)組
             int s1 = low;
             int e1 = mid;
             int s2 = mid+1;
             int e2 = high;
             int i = 0;
     while(s1<e1 && s2<e2){//循環(huán)的的條件
       if(array[s1] < array[s2]){
          tmp[i++] =  array[s1++];
         }else{
           tmp[i++] = array[s2++];
          }
      
      }
       while(s1 < s2){//當(dāng)?shù)竭@一步 說(shuō)明左側(cè)比右側(cè)長(zhǎng)   將左側(cè)剩余部分銜接到數(shù)組中
         tmp[i++] = array[s1++];
     }
      while(s2 < e2){
         tmp[i++] =  array[s2++];//當(dāng)?shù)竭@一步 說(shuō)明左側(cè)比右側(cè)長(zhǎng)   將左側(cè)剩余部分銜接到數(shù)組中
 
}
for(int j = 0; j < i; j++){//將tmp數(shù)組中元素放置array數(shù)組中 
     array[i+low] = tmp[j];
 
}