排序：归并排序

package com.qcby.wy0303;

public class MergeSort {

	
	 public static void mergeSort(int[] arr,int left ,int right) {
		 if(left>=right) {
			 return;
		 }
		 int mid = (left + right)/2;
		 mergeSort(arr,left,mid);
		 mergeSort(arr,mid+1,right);
	 }
	 //合并
	 public static void he(int[] arr,int left,int mid,int right) {
		 int s1 = left;
		 int s2 = mid +1;
		 int[] temp = new int[right -left +1];
		 int i = 0;
		 while(s1<=mid&&s2<=right) {
			 if(arr[s1]<=arr[s2]) {
				 temp[i++]=arr[s1++];
			 }else {
				 temp[i++]=arr[s2++];
			 }
		 }
		 while(s1<=mid) {
			 temp[i++]=arr[s1++];
		 }
		 while(s2<=mid) {
			 temp[i++]=arr[s2++];
		 }
		 for(int j = 0;j<temp.length;j++) {
			 arr[j+left] = temp[j];
		 }
		 
	 }
	 
}