Jump to content

Sorting algorithms/Quicksort: Difference between revisions

m
Line 4,024:
#
if mid < (right + left) / 2
call qsort left mid - 1 d[]
left = mid + 1
else
call qsort mid + 1 right d[]
right = mid - 1
.
.
.
funcproc sort . d[] .
call qsort 1 len d[] d[]
.
d[] = [ 29 4 72 44 55 26 27 77 92 5 ]
call sort d[]
print d[]
</syntaxhighlight>
2,060

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.