Rosetta Code

Sorting algorithms/Quicksort: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Added Oberon-2
Chkas (talk | contribs)
2,195 edits
Line 3,732:
 
=={{header|EasyLang}}==
<syntaxhighlight lang="text">data[] = [ 29 4 72 44 55 26 27 77 92 5 ]
func qsort left right . d[] .▼
#
▲func qsort left right . .
while left < right
# partition
swap data[(left + right) / 2] data[left]
piv = d[left]
mid = left
for i = left + 1 to right
if datad[i] < data[left]piv
mid += 1
swap datad[i] datad[mid]
.
.
swap datad[left] datad[mid]
#
call qsort left mid - 1▼
left =if mid < (right + 1left) / 2
▲ call qsort left mid - 1 d[]
left = mid + 1
else
call qsort mid + 1 right d[]
right = mid - 1
.
.
.
func sort . d[] .
#
call qsort 01 len datad[] - 1d[]
.
print data[]</syntaxhighlight>▼
d[] = [ 29 4 72 44 55 26 27 77 92 5 ]
call sort d[]
print d[]
▲print data[]</syntaxhighlight>
 
=={{header|EchoLisp}}==
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Quicksort"