归并排序

归并排序就是先递归分治，再进行合并排序，因为合并，所以需要一个辅助数组，空间复杂度为O(n);因为每个数和其他数比较log(n)次。所以时间为nlog(n)。应用的算法题比如 求逆序对。

package suanfa;




import java.util.Arrays;
import java.util.Scanner;import java.util.concurrent.CountDownLatch;

public class Main {
	
	public static void main (String[] args) {
		int[] arr = {4,2,3,5,3};
		int[] arr1 = {1,2,3,4,5};
		mergeSort(arr,0,arr.length-1);
		System.out.println(Arrays.toString(arr));
	}
	public static void mergeSort(int[] arr, int left, int right) {
		if(arr ==null || arr.length<2) {
			return;
		}
		if(left == right) {
			return;
		}
		int mid = (left + right)>>1;//除以2
		mergeSort(arr, left, mid);
		mergeSort(arr, mid+1, right);
		merge(arr, left,mid, right);//接下其实就是两个有序数组合并成为一个有序数组的过程
	}
	public static void  merge(int[] arr, int left,int mid, int right) {
		int[] help = new int [right-left+1];
		int i=0;
		int p1 = left;
		int p2 = mid +1;
		while(p1<=mid && p2<=right) {
			if(arr[p1]<=arr[p2]) {
				help [i] = arr[p1];
				p1++;
				i++;
			}
			if(arr[p1]>arr[p2]) {
				help [i] = arr[p2];
				p2++;
				i++;
			}
		}
		while(p1<=mid) {
			help[i] = arr[p1];
			i++;
			p1++;
		}
		while(p2<=right) {
			help[i] = arr[p2];
			i++;
			p2++;
		}
		for(i=0;i<help.length;i++) {
			arr[left] = help[i];
			left++;
		}
		
	}
	public static void  swap(int[] arr, int i,int j) {
		arr[i] = arr[i]^arr[j];
		arr[j] = arr[i]^arr[j];
		arr[i] = arr[i]^arr[j];
	}
}