快速排序 php与javascript的不同之处

<?php
$unsorted = array(2,4,5,63,2,43);
function quicksort($array)
{
if (count($array) == 0)
return array();
$pivot = $array[0];
$left = $right = array();
for ($i = 1; $i < count($array); $i++) {
if ($arraY[$i] < $pivot)
$left[] = $arraY[$i];
else
$right[] = $arraY[$i];
}
return array_merge(quicksort($left),array($pivot),quicksort($right));
}
$sorted = quicksort($unsorted);
print_r($sorted);

var a = [2,43];
function quicksort(arr)
{
if (arr.length == 0)
return [];
var left = new Array();
var right = new Array();
var pivot = arr[0];
for (var i = 1; i < arr.length; i++) {
if (arr[i] < pivot) {
left.push(arr[i]);
} else {
right.push(arr[i]);
}
}
return quicksort(left).concat(pivot,quicksort(right));
}
console.log(quicksort(a));

if (count($array) < 2)
return $array;

// this will result with an error
if (arr.length < 2)
return arr;