@gerauchertHere is some raw ways to do this (using Simba code, without plugin) - links @pastebin:
ShellSortHeapSortQuickSortQuickSort23-Way QuickSortMergeSortBottom-Up MergeSortInsertionSortSelectionSortBubbleSortTSAJnlbSortDnmcTSAJnlbSortTook those algorithms directly from libsorting.dll, edited em a bit and then included small example for each one. :p
Also, if you want it to be really quick, then I recommend you'll give a try at
libsorting.dllThe plugin contains procedure TSASort(), which supports several algorithms. :)
You can sort both ways with it aswell! (Low=>High [A, B, C, D] OR High=>Low [D, C, B, A])
..the plugin is open-source, so you can grab those TSA sorting algorithms from the plugin incase you don't want to use TSASort().
Included a small example to that topic, about sorting TStringArrays with it:
{$LOADLIB libsorting.dll}
var
TSA: array of string;
begin
TSA := ['Apple', 'Orange', 'Lemon', 'Banana', 'Pear'];
TSASort(TSA, sa_ShellSort, so_HighToLow); // Reversed.
WriteLn(ToStr(TSA));
TSASort(TSA, sa_MergeSort, so_LowToHigh); // Default.
WriteLn(ToStr(TSA));
end.
Which debugs:
Compiled successfully in 31 ms.
['Pear', 'Orange', 'Lemon', 'Banana', 'Apple']
['Apple', 'Banana', 'Lemon', 'Orange', 'Pear']
Successfully executed.
-Jani