Sorting algorithms/Bubble sort: Difference between revisions

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