1、快速排序法概念數組
function quicksort(arr){ if(arr.length<2){ return arr; } var midIndex = arr.length%2 == 0? arr.length/2 : (arr.length+1)/2; var mid = arr[midIndex]; var left = []; var right = []; for(var i=0;i<arr.length;i++){ if(i != midIndex && arr[i] <= mid){ left.push(arr[i]); } if(i != midIndex && arr[i] > mid){ right.push(arr[i]) } } return quicksort(left).concat(mid).concat(quicksort(right)) }