1. PHP

2. JavaScript
var a = [2,4,5,63,4,5,63,2,4,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));

Note that the first conditional statement is quite important! While in PHP the count function will return 0 either on a NULL value or an empty array and you can substitute it with something like count($array) < 2
if (count($array) < 2)
	return $array;

in JavaScript you cannot use that because of the presence of the 'undefined' value when an "empty" array is passed as an argument. Thus you've the conditional above:
// this will result with an error
if (arr.length < 2)
        return arr;

Coming Up Next ...
An iterative version of the algorithm next Friday!

Related posts:

Friday Algorithms: Sorting a Set of Integers – Far Quicker than Quicksort! 
Friday Algorithms: Iterative Quicksort 
JavaScript Objects Coding Style 
Friday Algorithms: JavaScript Bubble Sort 


]]>
			/2010/06/11/friday-algorithms-quicksort-difference-between-php-and-javascript/feed/
		6