paweld/fpc
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/fpc/source.git synced 2025-08-11 17:47:56 +02:00
Code Issues Packages Projects Releases Wiki Activity

* Patch from Mattias Gaertner to improve quicksort memory use (Bug 22119)

Browse Source 
git-svn-id: trunk@21386 -
This commit is contained in:
michael 2012-05-24 19:18:44 +00:00
parent 21b94f675f
commit 032528115f
1 changed files with 16 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
rtl/objpas/classes/lists.inc
View File

@ -318,10 +318,22 @@ begin
J := J - 1;
end;
until I > J;
if L < J then
QuickSort(FList, L, J, Compare);
L := I;
until I >= R;
// sort the smaller range recursively
// sort the bigger range via the loop
// Reasons: memory usage is O(log(n)) instead of O(n) and loop is faster than recursion
if J - L < R - I then
begin
if L < J then
QuickSort(FList, L, J, Compare);
L := I;
end
else
begin
if I < R then
QuickSort(FList, I, R, Compare);
R := J;
end;
until L >= R;
end;
procedure TFPList.Sort(Compare: TListSortCompare);