Home
Random
Log in
Settings
About Rosetta Code
Disclaimers
Rosetta Code
Search
Sorting algorithms/Bubble sort: Difference between revisions
Page
Discussion
← Older edit
Newer edit →
Sorting algorithms/Bubble sort
(view source)
Revision as of 07:06, 9 May 2011
2 bytes added
,
13 years ago
→{{header|Delphi}}
Revision as of 07:02, 9 May 2011
(
view source
)
rosettacode>Sergworks
(
→{{header|Delphi}}
)
← Older edit
Revision as of 07:06, 9 May 2011
(
view source
)
rosettacode>Sergworks
(
→{{header|Delphi}}
)
Newer edit →
Line 660:
begin
L:= Low(A) + 1;
K:= High(A);
▼
repeat
▲
K:= High(A);
for J:= High(A) downto L do begin
if A[J - 1] > A[J] then begin
Anonymous user
rosettacode>Sergworks