Sorting algorithms/Bubble sort: Difference between revisions
Content added Content deleted
m (+wp ref) |
(Pascal language was added) |
||
Line 1,548: | Line 1,548: | ||
in |
in |
||
{Show {BubbleSort [3 1 4 1 5 9 2 6 5]}}</lang> |
{Show {BubbleSort [3 1 4 1 5 9 2 6 5]}}</lang> |
||
=={{header|Pascal}}== |
|||
<lang pascal>procedure bubble_sort(n: integer; var list: array of real); |
|||
var |
|||
i, j: integer; |
|||
t: real; |
|||
begin |
|||
for i := n downto 2 do |
|||
begin |
|||
for j := 0 to i - 1 do |
|||
begin |
|||
if list[j] < list[j + 1] then |
|||
begin |
|||
continue |
|||
end; |
|||
t := list[j]; |
|||
list[j] := list[j + 1]; |
|||
list[j + 1] := t; |
|||
end; |
|||
end; |
|||
end;</lang> |
|||
Usage:<lang pascal> |
|||
var |
|||
list: array[0 .. 9] of real; |
|||
// ... |
|||
bubble_sort(9, list); |
|||
</lang> |
|||
=={{header|Perl}}== |
=={{header|Perl}}== |