Array sortieren

[nahpets]

Delphi-Quellcode:

  for i := low(ArrAngKps) to Pred(high(ArrAngKps)) do
    for j := succ(i) to high(ArrAngKps) do
      if ArrAngKps[j].CrtDatum > ArrAngKps[j + 1].CrtDatum // wenn j = high(ArrAngKps) ist, gibt es j + 1 nicht.
      then
      Begin
        TmpAng := ArrAngKps[i];
        ArrAngKps[i] := ArrAngKps[j];
        ArrAngKps[j] := TmpAng;
      end;

  for i := 0 to length(ArrAngKps) - 1 do
  Begin
    for j := 0 to length(ArrAngKps) - 2 do
    begin
      if ArrAngKps[i].CrtDatum > ArrAngKps[j + 1].CrtDatum then
      Begin
        // Warum j und j + 1 tauschen, wenn i und j + 1 verglichen wurden?
        TmpAng := ArrAngKps[j];
        ArrAngKps[j] := ArrAngKps[j + 1];
        ArrAngKps[j + 1] := TmpAng;
      end;
    end;
  end;