J. Gareth Moreton via fpc-devel <fpc-devel@lists.freepascal.org> schrieb am
Di., 29. Nov. 2022, 10:09:

> Surely that's a bug in the comparison functions that should be fixed and
> not something that can be blamed on introsort.  If a comparison function
> is faulty, then pretty nuch any sorting algorithm can be considered to
> have unpredictable behaviour.

This *can* be blamed on IntroSort, because Stability (order of equal
elements is kept) is an attribute of sorting algorithms and IntroSort is
*not* considered stable while QuickSort *can* be stable depending on the
implementation and ours *is*.


fpc-devel maillist  -  fpc-devel@lists.freepascal.org

Reply via email to