package sort;
/**
* 归并排åºçš„æ€æƒ³æ˜¯å°†æ•°ç»„分æˆä¸¤éƒ¨åˆ†ï¼Œåˆ†åˆ«è¿›è¡ŒæŽ’åºï¼Œç„¶åŽå½’并起æ¥ã€‚
*
* @author 刘壮飞
* https://github.com/zfman.
* https://blog.csdn.net/lzhuangfei.
*/
public abstract class MergeSort> extends Sort {
protected T[] tmp;
protected void merge(T[] nums, int l, int m, int h) {
//i:待归并的å‰è€…çš„ä½ç½®,j:待归并的åŽè€…çš„ä½ç½®
int i = l, j = m + 1;
for (int k = l; k <= h; k++) {
tmp[k] = nums[k];
}
//两个ååºåˆ—åˆå¹¶
int v=l;
while(i<=m&&j<=h){
if(tmp[i].compareTo(tmp[j])<=0) nums[v++]=tmp[i++];
else nums[v++]=tmp[j++];
}
if(m>i){
for(;j<=h;j++) nums[v++]=tmp[j];
}
if(j>h){
for(;i<=m;i++) nums[v++]=tmp[i];
}
}
}