var quickSort = function(arr) {
if (arr.length <= 1) { return arr; } //判断数组长度
var pivotIndex = Math.floor(arr.length / 2); //获取中间数的索引
var pivot = arr.splice(pivotIndex, 1)[0]; //把中间数拿出来
var left = [];
var right = [];
for (var i = 0; i < arr.length; i++){
if (arr[i] < pivot) {
left.push(arr[i]);
} else {
right.push(arr[i]);
}
}
return quickSort(left).concat([pivot], quickSort(right)); //循环排序
}