Sorting algorithms/Quicksort: Difference between revisions
m
→{{header|Easyprog.online}}
m (→{{header|E}}) |
|||
Line 2,049:
#
func qsort left right . .
while left < right▼
# ▼
swap data[(left + right) / 2] data[left]
mid = left
Line 2,060 ⟶ 2,059:
.
swap data[left] data[mid]
▲ while left < right
call qsort left mid - 1
left = mid + 1
.
.
call qsort 0 len data[] - 1
print data[]</lang>
| |||