Sort an integer array: Difference between revisions
Content added Content deleted
(Add min) |
(Added Algol W) |
||
Line 122: | Line 122: | ||
<pre> |
<pre> |
||
+1 +2 +2 +3 +4 |
+1 +2 +2 +3 +4 |
||
</pre> |
|||
=={{header|ALGOL W}}== |
|||
Algol W doesn't have standard sorting facilities. This uses the Algol W quicksort sample in the Sorting Algorithms Quicksort task. |
|||
<lang algolw>begin |
|||
% use the quicksort procedure from the Sorting_Algorithms/Quicksort task % |
|||
% Quicksorts in-place the array of integers v, from lb to ub - external % |
|||
procedure quicksort ( integer array v( * ) |
|||
; integer value lb, ub |
|||
) ; algol "sortingAlgorithms_Quicksort" ; |
|||
% sort an integer array with the quicksort routine % |
|||
begin |
|||
integer array t ( 1 :: 5 ); |
|||
integer p; |
|||
p := 1; |
|||
for v := 2, 3, 1, 9, -2 do begin t( p ) := v; p := p + 1; end; |
|||
quicksort( t, 1, 5 ); |
|||
for i := 1 until 5 do writeon( i_w := 1, s_w := 1, t( i ) ) |
|||
end |
|||
end.</lang> |
|||
{{out}} |
|||
<pre> |
|||
-2 1 2 3 9 |
|||
</pre> |
</pre> |
||