js 归并排序

js归并排序
思路： 将数组粒度拆到最小，相互对比；其中回调是用来判断升降序的

function merge(left, right, cd){
	const res = [];
	while(left.length && right.length){
		let isAscendingOrder = typeof cd === 'function' && cd(left[0], right[0]);
		if (typeof cd !== 'function' || isAscendingOrder === null){
			if(left[0] <= right[0]){
				res.push(left.shift());
			} else {
				res.push(right.shift());
			}
		} else {
			if(isAscendingOrder){
				res.push(left.shift());
			} else {
				res.push(right.shift());
			}
		}
	}
	return res.concat(left, right);
}
function sort(Arr, cd){
	if(!Array.isArray(Arr) || Arr.length === 1 || !Arr) return Arr;
	const mid = Math.floor(Arr.length / 2);
	const left = sort(Arr.slice(0, mid), cd);
	const right = sort(Arr.slice(mid), cd);
	return merge(left, right, cd);
}