paweld/fpc
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/fpc/source.git synced 2025-09-06 15:31:19 +02:00
Code Issues Packages Projects Releases Wiki Activity

* fixed quicksort comment about memory use - our implementation uses O(log n) stack, not O(n log n)

Browse Source 
git-svn-id: trunk@41236 -
This commit is contained in:
nickysn 2019-02-06 12:22:08 +00:00
parent 4d8ae767f7
commit f4718831ca
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
rtl/inc/sortbase.pp
View File

@ -46,7 +46,7 @@ type
Average performance: O(n log n)
Worst performance: O(n*n)
Extra memory use: O(n log n) on the stack
Extra memory use: O(log n) on the stack
Stable: no
Additional notes: Uses the middle element as the pivot. This makes it work
well also on already sorted sequences, which can occur