<script> 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)); }; var sdt=[85, 24, 63, 45, 17, 31, 96, 50]; var sdd=quickSort(sdt); var strio=""; for(i=0,len=sdd.length;i<len;i++) strio+="|"+sdd[i]; alert(strio); </script>我觉得他的运用很精辟!
<script>
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));
};
var sdt=[85, 24, 63, 45, 17, 31, 96, 50];
var sdd=quickSort(sdt);
var strio="";
for(i=0,len=sdd.length;i<len;i++)
strio+="|"+sdd[i];
alert(strio);
</script>我觉得他的运用很精辟!
if(e - s > 1) {
var temp;
var st = s;
var et = e;
temp = arr[s];
while(st < et) {
if(arr[et] > temp) {
arr[st] = arr[et];
st++;
while(st < et) {
if(arr[st] < temp) {
arr[et] = arr[st];
break;
} else {
st++;
}
}
} else {
et--;
}
}
arr[st] = temp;
quickSort(arr, s, st - 1);
quickSort(arr, st + 1, e);
}
}