Sorting algorithms/Bubble sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 2,000: / Line 2,000: @@
 <lang pascal>procedure bubble_sort(n: integer; var list: array of real);
 var
-        i, j: integer;
+  i, j: integer;
-        t: real;
+  t: real;
 begin
-        for i := n downto 2 do
+  for i := n downto 2 do
-        begin
+     for j := 0 to i - 1 do
+     begin
-                for j := 0 to i - 1 do
-                begin
+         if list[j] < list[j + 1] then
-                        if list[j] < list[j + 1] then
+           continue;
-                        begin
+         t := list[j];
-                                continue
+         list[j] := list[j + 1];
-                        end;
+         list[j + 1] := t;
+     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;
+  list: array[0 .. 9] of real;
 // ...
 bubble_sort(9, list);