php算法-快速排序

$arr = [1,6,8,53,4,7,8,1,45,6];
	var_dump(quickSort($arr));exit;
	
	function quickSort($arr){
		$count = count($arr);
		if($count <= 1){
			return $arr;
		}
		
		$curNum = $arr[0];
		$left = $right = [];
		for($i = 1;$i < $count;$i++){
			if($arr[$i] >= $curNum){
				$right[] = $arr[$i];
			}else{
				$left[] = $arr[$i];
			}
		}
		
		$right = quickSort($right);
		$left = quickSort($left);
		
		return array_merge($right,[$curNum],$left);
	}