代码大全

LowerBoundary : = Data[ FirstElmt_t ] ;
Data[ FirstElmt –1 ] : = SortMin ;
{The elements in positions FirstElmt through SortBoundary-1 are
always sorted. In each pass through the loop, SortBoundary
is increased, and the element at the position of the
new SortBoundary Probably isn’t in its sorted place in the
array, so it’s inserted into the proper place somewhere
between FirstElmt and SortBoundary.}
for SortBoundary : = FirstElmt +1 to LastElmt to do
begin
InsertVal : = Data[ SortBoundary ];
InsertPos : = SortBoundary;
while InsertVal < Data[ InsertPos - 1 ] do
begin
Data[ InsertPos ] := Data[ InsertPos-1 ] ;
InsertPos := InsertPos –1 ;
end;
Data[ InsertPos ] := InsertVal ;
end; { Replace orginal lower-boundary element }
Data[ FirstElmt-1 ] : = LowBoundary ;
end; { InsertionSort }

18-1

0

18 3

18-3 Pascal

procedure InsertionSort

(

Var Data : SortArray_t;

FirstElmt: Integer;

LastElmt : Integer

);

{ use the insertion sort technique to sort the “Data” array in ascending order.

This routine assumes that Data[FirstElmt] is not the FirstElmt element in Data and that

Data[ FirstElmt-1 ] can be accessed. }

Const

SortMin = ’ ’;

Var