package 算法;
import java.util.Arrays;
public class 归并排序 {
public static void main(String[] args) {
int [] a={1,5,4,3,7,8,6};
merge(a,0,6);
System.out.println(Arrays.toString(a));
}
static void merge(int a[],int start,int end){
if(start>=end){
return ;
}
int middle=(start+end)/2;
merge(a,start,middle);
merge(a,middle+1,end);
int leftIndex=start;
int rightIndex=middle+1;
int left[]=a;
int right[]=a;
for(int i=start;i<end;i++){
if(left[leftIndex]>right[rightIndex]){
a[i]=right[rightIndex++];
}else{
leftIndex++;
}
}
}
}