quickSort

by xu xiaofei

JavaScript

function quickSort(arr) {
	if(arr.length<2) return arr
	const base = arr[0]
	const left = []
	const right = []
	for(let i=1;i<arr.length;i++) {
		if(arr[i]>base) {
			right.push(arr[i])
		} else {
			left.push(arr[i])
		}
	}
	return [...quickSort(left), base, ...quickSort(right)]
}
const r = quickSort([3,2,1,4,6,7,8,4,3,9,1,4,0])
console.log(r)
document.write(r)