Sorting algorithms/Bubble sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,809: / Line 1,809: @@
 =={{header|Seed7}}==
-<lang seed7>const proc: bubbleSort (inout array integer: arr) is func
+<lang seed7>const proc: bubbleSort (inout array elemType: arr) is func
- local
+  local
-   var integer: i is 0;
+    var boolean: swapped is FALSE;
-   var integer: j is 0;
+    var integer: i is 0;
-   var integer: help is 0;
+    var elemType: help is elemType.value;
- begin
+  begin
+    repeat
-   for i range 1 to length(arr) do
+      swapped := FALSE;
-     for j range succ(i) to length(arr) do
-       if arr[i] < arr[j] then
+      for i range 1 to length(arr) - 1 do
-         help := arr[i];
+        if arr[i] > arr[i + 1] then
-         arr[i] := arr[j];
+          help := arr[i];
-         arr[j] := help;
+          arr[i] := arr[i + 1];
-       end if;
+          arr[i + 1] := help;
-     end for;
+          swapped := TRUE;
-   end for;
+        end if;
- end func;
+      end for;
+    until not swapped;
-var array integer: arr is [] (3, 78, 4, 23, 6, 8, 6);
-bubbleSort(arr);</lang>
+  end func;</lang>
+Original source: [http://seed7.sourceforge.net/algorith/sorting.htm#bubbleSort]
 =={{header|Smalltalk}}==