Sorting algorithms/Bubble sort: Difference between revisions
no edit summary
(→{{header|Icon}}: note on mixed type sorting) |
No edit summary |
||
Line 1,413:
END Sort;
END Bubble.</lang>
=={{header|Objeck}}==
<lang objeck>
{{trans|C}}
function : Swap(p : Int[]) ~ Nil {
t := p[0];
p[0] := p[1];
p[1] := t;
}
function : Sort(a : Int[]) ~ Nil {
do {
sorted := true;
size -= 1;
for (i:=0; i<a->Size(); i+=1;) {
if (a[i+1] < a[i]) {
swap(a+i);
sorted := 0;
};
};
}
while (sorted = false);
}
</lang>
=={{header|OCaml}}==
| |||