private static void merge(int[] data, int left, int center, int right){
		int[] temArr = new int[data.length];
		int mid = center + 1;
		int i = left;
		int tem = left;
		while(left <= center && mid <= right){
			if(data[left]<=data[mid]){
				temArr[i++] = data[left++];
			} else {
				temArr[i++] = data[mid++];
			}
		}
		while(mid <= right){
			temArr[i++] = data[mid++];
		}
		while(left <= center){
			temArr[i++] = data[left++];
		}
		while(tem <= right){
			data[tem] = temArr[tem++];
		}
	}