Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
→{{header|Delphi}}
Line 348:
S[J + 1]:= Ch;
end;
end;</lang>
<pre>
// in : S = 'the quick brown fox jumps over the lazy dog'
|
Line 348:
S[J + 1]:= Ch;
end;
end;</lang>
<pre>
// in : S = 'the quick brown fox jumps over the lazy dog'
|