归并排序

归并排序 采用分治策略 ，先分再治； 分为 把序列递归拆分成一个一个的单数；认为有序；

然后再合并

每一次扫描需要O(n)时间，二叉树的深度可知，扫描需要logn次。时间复杂度：O（n*logn）;

空间需要一个储存数组O(n);

稳定

public class MergingSort {

//	static int[] sqlist = {0,9,8,7,5,6,4,3,2,1,12,23};
	static int[] sqlist = {0,50,10,90,30,70,40,80,60,20};
	
	public static void main(String[] args) {
//		int[] sqlist={0,3,2,4,7,5};
		mergesort(sqlist,0,sqlist.length-1);
		for (int i = 0; i < sqlist.length; i++) {
			System.out.print(sqlist[i] + " ");
		}
	}

	private static void mergesort(int[] sqlist2, int start, int end) {
		if (start==end) {
			return;
		}
		int mid = (start+end)/2;
		mergesort(sqlist2, start, mid);
		mergesort(sqlist2, mid+1, end);
		Merge(sqlist2, start, mid, end);
	}

	private static void Merge(int[] sqlist2, int start, int middle, int end) {
		// TODO Auto-generated method stub
		//K是答案空数组的游标；k从start起点开始移动；合并start到end位置的数组；
		int[] temp = new int[sqlist2.length];
		int startleft = start;
		int startmid = middle+1;
		int k=start;
		for (; startleft<=middle&&startmid<=end; k++) {
			if (sqlist2[startleft]<sqlist2[startmid]) {
				temp[k]=sqlist2[startleft++];
			}else {
				temp[k]=sqlist2[startmid++];
			}
		}
		
		if (startleft<=middle) {
			for (; k <= end && startleft <= middle; k++) {
				temp[k] = sqlist2[startleft++];
			}
		}
		
		if (startmid<=end) {
			for (; k <= end && startmid <= end; k++) {
				temp[k] = sqlist2[startmid++];
			}
		}
		for (int i = start; i <= end; i++) {
			sqlist2[i] = temp[i];
		}
	}
}