Sorting algorithms/Quicksort: Difference between revisions
→{{header|EasyLang}}
Line 4,010:
=={{header|EasyLang}}==
<syntaxhighlight lang="text">
while left < right
# partition
piv = d[left]
mid = left
for i = left + 1 to right
if d[i] < piv
mid += 1
swap d[i] d[mid]
.▼
.
swap d[left] d[mid]
▲ .
if mid < (right + left) / 2
call qsort mid + 1 right d[]
.
func sort . d[] .
call qsort 1 len d[] d[]
.
d[] = [ 29 4 72 44 55 26 27 77 92 5 ]
| |||