Javascript recursive quicksort

quicksort

function quickSort(A) {
	var smaller = []; var larger = [];
	if (A.length <= 1)
		return A;
	
	for (var i = 1; i < A.length; i++) { 
		if (A[i] < A[0])
			smaller.push(A[i]); 
		if (A[i] >= A[0]) 
			larger.push(A[i]); 
	}
	return quickSort(smaller).concat(A[0], quickSort(larger));
}