06-排序算法-内部排序.归并排序

package 内部排序.归并排序;

import java.util.Arrays;

/**

• 归并思想，分治策略
  */
  public class MergeSort {
  public static void main(String[] args) {
  int arr[]={6,-8,43,3,9,-1,45};
  int[] tmp = new int[arr.length]; //新建一个临时数组存放
  mergeSort(arr, 0, arr.length - 1, tmp);
  System.out.print(Arrays.toString(arr));
  }

  public static void merge(int[] arr,int low,int mid,int high,int[] tmp){
  int i = 0;
  int j = low,k = mid+1; //左边序列和右边序列起始索引
  while(j <= mid && k <= high){
  if(arr[j] < arr[k]){
  tmp[i++] = arr[j++];
  }else{
  tmp[i++] = arr[k++];
  }
  }
  //若左边序列还有剩余，则将其全部拷贝进tmp[]中
  while(j <= mid){
  tmp[i++] = arr[j++];
  }

   while(k <= high){
       tmp[i++] = arr[k++];
   }
  
   for(int t=0;t<i;t++){
       arr[low+t] = tmp[t];
   }
  

  }

  public static void mergeSort(int[] arr,int low,int high,int[] tmp){
  if(low<high){
  int mid = (low+high)/2;
  mergeSort(arr,low,mid,tmp); //对左边序列进行归并排序
  mergeSort(arr,mid+1,high,tmp); //对右边序列进行归并排序
  merge(arr,low,mid,high,tmp); //合并两个有序序列
  }
  }

}