Anonymous user
Sorting algorithms/Quicksort: Difference between revisions
JavaScript
m (→{{header|Java}}: Added comment about pivot value) |
(JavaScript) |
||
Line 253:
return less;
}</java>
=={{header|JavaScript}}==
<javascript>function sort(a,less) {
function swap(i,j) { var t=a[i]; a[i]=a[j]; a[j]=t }
function qs(l,r) {
if (l<r) {
var pivot = a[(l+r)>>1];
var l2=l, r2=r;
do {
while (less(a[l2], pivot) ++l2;
while (less(pivot, a[r2]) --r2;
if (l2 <= r2) swap(l2++, r2--);
} while (l2 <= r2);
qs(l, r2);
qs(l2, r);
}
}
qs(0, a.length-1);
return a;
}</javascript>
=={{header|Joy}}==
| |||