Janilabo | TSAInsertionSort() [Simba]

procedure TSAInsertionSort(var TSA: TStringArray; order: (so_LowToHigh, so_HighToLow));
var
  a, b, h: Integer;
  tmp: string;
begin
  h := High(TSA);
  if (h > 0) then
  case order of
    so_LowToHigh:
    for a := 1 to h do
      for b := a downto 1 do
      begin
        if not (TSA[b] < TSA[(b - 1)]) then
          Break;
        tmp := TSA[(b - 1)];
        TSA[(b - 1)] := TSA[b];
        TSA[b] := tmp;
      end;
    so_HighToLow:
    for a := 1 to h do
      for b := a downto 1 do
      begin
        if not (TSA[b] > TSA[(b - 1)]) then
          Break;
        tmp := TSA[(b - 1)];
        TSA[(b - 1)] := TSA[b];
        TSA[b] := tmp;
      end;
  end;
end;

var
  TSA: TStringArray;

begin
  TSA := ['Apple', 'Orange', 'Lemon', 'Banana', 'Pear'];
  TSAInsertionSort(TSA, so_HighToLow); // Reversed.
  WriteLn(ToStr(TSA));
  TSAInsertionSort(TSA, so_LowToHigh); // Default.
  WriteLn(ToStr(TSA));
end.