Sorting algorithms/Cocktail sort: Difference between revisions
→{{header|ALGOL 60}}: better
m (Rust - replace Ord by PartialOrd) |
PatGarrett (talk | contribs) (→{{header|ALGOL 60}}: better) |
||
Line 181:
<lang algol60>begin
comment Sorting algorithms/Cocktail sort - Algol 60;
nA:=20;
procedure cocktailsort(lb,ub);▼
value lb,ub; integer lb,ub;▼
begin
integer
boolean swapped;▼
begin
lbx:=lb; ubx:=ub-1; swapped
for i:=1 while swapped
A[i] :=A[i+1];▼
A[i+1]:=temp;▼
swapped:=true▼
end swap;▼
▲ swapped:=true
then begin
for i:=ubx step -1 until lbx do if A[i]>A[i+1] then swap(i);
ubx:=ubx-1; lbx:=lbx+1
end
end
end cocktailsort;
begin▼
for i:=lb step 1 until ub do A[i]:=entier(rand*100)
integer i;▼
end inittable;
▲ for i:=lb step 1 until ub do A[i]:=entier(rand*100)
▲ integer i;
for i:=lb step 1 until ub do outinteger(1,A[i]);
nA:=20;
inittable(1,nA
▲ writetable(1,nA)
end </lang>
{{out}}
Line 236 ⟶ 241:
3 6 14 16 19 23 28 33 33 47 61 62 64 67 73 77 78 81 83 92
</pre>
=={{header|ALGOL 68}}==
|