Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
| Line 4,024: | Line 4,024: | ||
# |
# |
||
if mid < (right + left) / 2 |
if mid < (right + left) / 2 |
||
qsort left mid - 1 d[] |
|||
left = mid + 1 |
left = mid + 1 |
||
else |
else |
||
qsort mid + 1 right d[] |
|||
right = mid - 1 |
right = mid - 1 |
||
. |
. |
||
. |
. |
||
. |
. |
||
proc sort . d[] . |
|||
qsort 1 len d[] d[] |
|||
. |
. |
||
d[] = [ 29 4 72 44 55 26 27 77 92 5 ] |
d[] = [ 29 4 72 44 55 26 27 77 92 5 ] |
||
sort d[] |
|||
print d[] |
print d[] |
||
</syntaxhighlight> |
</syntaxhighlight> |
||