JSFiddle - React, Tailwind, and code Playground

by xu xiaofei

JavaScript

console.clear()
const arr = [9,3,5,1,4,2,7,8,6,0]

function quickSort(l, r) {
	const temp = arr[l]
	if(l>r) return arr;
	let left = l
	let right = r
	while(left<right) {
		while(arr[right]>temp && left<right) {
			right ++ 
		}
		while(arr[left]<temp && left<right) {
			left ++ 
		}
		const t = arr[right]
		arr[right] = arr[left]
		arr[left] = t
	}
	console.log(arr)
	quickSort(l, left-1)
	quickSort(left+1, r)
}


quickSort(0, arr.length-1)
console.log(arr)