1.归并排序
public static int[] sort(int[] arr,int left,int right){
int mid = left + (right - left)/2;
if(left < right){
sort(arr,left,mid);
sort(arr,mid + 1,right);
merge(arr,left,mid,right);
}
return arr;
}
public static void merge(int[] arr,int left,int mid