Is there a built-in sorting procedure in Delphi?

In Delphi there is a TList which can store arbitrary data types and allows them to be sorted. The TList.Sort() method takes your sorting function as an argument. The list is QuickSort inside TList ( QuickSort used), but each pair of elements is compared by calling the function you specified for this method.

The minimum example that shows how you can sort a list by a particular field, simply substituting the desired sort function:

 uses Classes, SysUtils; type TListItem = record F1: string; F2: Integer; end; PListItem = ^TListItem; function CompareByF1(Item1, Item2: Pointer): Integer; begin Result := CompareText(PListItem(Item1).F1, PListItem(Item2).F1); end; function CompareByF2(Item1, Item2: Pointer): Integer; begin Result := PListItem(Item1).F2 - PListItem(Item2).F2; end; procedure Test; var I: Integer; VList: TList; VTestItem: PListItem; begin VList := TList.Create; try try // заполнение списка данными for I := 9 downto 0 do begin New(VTestItem); // динамическое выделение памяти для элемента списка VTestItem.F1 := 'TestStr#' + IntToStr(I); VTestItem.F2 := I; VList.Add(VTestItem); end; // тестовая перчать списка ДО сортировки for I := 0 to VList.Count - 1 do begin Writeln(PListItem(VList.Items[I]).F1); end; Writeln; VList.Sort(CompareByF2); // сортировка по нужному нам полю // тестовая перчать списка ПОСЛЕ сортировки for I := 0 to VList.Count - 1 do begin Writeln(PListItem(VList.Items[I]).F1); end; finally for I := 0 to VList.Count - 1 do begin Dispose(VList.Items[I]); // освобождение ранее выделенной памяти end; end; finally VList.Free; end; end; 

And here: How do I sort a generic list using a custom comparer? There is an example of how to sort the list, in versions of Delphi with generic support.