js 快速排序

function Quick (arr) {
	if (arr.length <= 1){
		return arr
	}
	let pindex = Math.floor(arr.length/2)
	let val = arr.splice(pindex, 1)[0]
	// console.log('arr', arr,'val', val, 'pindex', pindex)
	let left = []
	let right = []
	arr.forEach(e => {
		e >= val ? right.push(e) : left.push(e)
	})
	// console.log('left',left,'right',right)
	//console.log('结束第几次排序')
	return Quick(left).concat([val], Quick(right))
}