On Mon, Dec 09, 2024 at 08:45:33PM +0100, Mikael Djurfeldt wrote: > On Mon, Dec 9, 2024 at 8:23 PM <to...@tuxteam.de> wrote: > > > (lambda (p1 p2) (< (car p1) (car p2))) > > > > Then you'd need a corresponding equal, because otherwise you > > end up with things which are neither less nor equal nor greater, > > i.e. the ordering isn't total, which is bad for sorting :) > > > > `sort' assumes that the elements belong to a "strict total order", which > means that the connectedness-axiom is true, which means that a = b is > *equivalent to* not (a < b or a > b). So, we don't need equal.
I think we need one of = or >, which we both don't have. We just have <, which is one too few. Cheers -- t
signature.asc
Description: PGP signature
