Am 29.11.2022 um 11:08 schrieb Sven Barth via fpc-devel:
J. Gareth Moreton via fpc-devel <> 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
    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*.

If for two elements [a, b] the comparison function returns
a<b=true and b<a=true

then the problem is not in stability or any other feature of the sorting algorithm but in the comparison function indeed. Or am I missing something?

fpc-devel maillist  -

Reply via email to