Quicksort: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
<div style="font-size: 1.2em; margin:.5em 0 .5em 0;text-align:center">[https://openlearnware.tu-darmstadt.de/#!/resource/quick-sort-1945 Openlearnware]</div> | <div style="font-size: 1.2em; margin:.5em 0 .5em 0;text-align:center">[https://openlearnware.tu-darmstadt.de/#!/resource/quick-sort-1945 Openlearnware]</div> | ||
</div> | </div> | ||
<syntaxhighlight lang="io"> | <syntaxhighlight lang="io" line start="1"> | ||
Quicksort(A, p, r) | |||
if p < r | |||
q = Partition(A, p, r) | |||
Quicksort(A, p, q - 1) | |||
Quicksort(A, q + 1, r) | |||
</syntaxhighlight> | |||
<syntaxhighlight lang="io" line start="1"> | |||
Partition(A, p, r) | Partition(A, p, r) | ||
x = A[r] | x = A[r] | ||
Revision as of 13:02, 11 September 2014
Quicksort(A, p, r)
if p < r
q = Partition(A, p, r)
Quicksort(A, p, q - 1)
Quicksort(A, q + 1, r)
Partition(A, p, r)
x = A[r]
i = p-1
for j = p to r - 1
if A[j] <= x
i = i + 1
exchange A[i] with A[j]
exchange A[i + 1] with A[r]
return i + 1