JavaScript快速排序

function quickSort(arr){
	var arrLeft = [],
		arrRight = [],
		arrLen = arr.length,
		pointIndex = parseInt(arrLen / 2),
		point = arr[pointIndex];
	for(var i = 0; i < arrLen; i++){
		if(i === pointIndex){
			continue;
		}
		if(arr[i] < point){
			arrLeft.push(arr[i]);
		} else {
			arrRight.push(arr[i]);
		}
	}
	return quickSort(arrLeft).concat(point, quickSort(arrRight));
}