面试算法整理「归并」

归并思路

核心思路：对于数组arr[left, right]，先把子序列arr[left, mid-1]排好序，再把arr[mid, right]排好序，最后合并两个有序子序列

方法：用基本数组先自己推一遍
[3,2,6,9,1]
step1：排序arr[left, mid-1]和arr[mid,right],
[3,2] [6,9,1]
step2：[3,2] [6] [9,1]

const mergeSort = (arr, left, right) => {
	if(left >= right) return
	const mid = (left+right) >> 1 // 除以2
	// const mid = left + Math.floor(right-left)
	mergeSort(arr, left, mid)
	mergeSort(arr, mid, right)
	merge(arr,left,mid,right) // 后序遍历
}
// 将有序数组 nums[lo..mid] 和有序数组 nums[mid+1..hi]合并
const merge= (arr,left,mid,right) => {
	let i = left, j =mid+1
	let temp = []
	while(i <= mid && j<=right) {
		if(arr[i] < arr[j]) {
			temp.push(arr[i++])
		}else {
			temp.push(arr[j++])
		}
	}
		while(i <= mid) {
			temp.push(arr[i++])
		}
		while(j <= right) {
			temp.push(arr[j++])
		}
	const len = temp.length
	for(let index =0; index<len;index++) {
		arr[left+index] = temp[index]
	} 
}
const arr = [3,2,6,9,1]
mergeSort(arr, 0, nums,length-1)