Sorting algorithm

Xinok xinok at live.com
Sat Oct 8 09:18:47 PDT 2011


On 10/8/2011 11:56 AM, Andrei Alexandrescu wrote:
> I think I'm missing something. Again: if you have "<" then "<=", ">",
> and ">=" are zero cost.
>
> What is more expensive is deciding a == b. You need to do it by saying
> !(a < b) && !(b < a). That's a cost worth paying because the second
> expression is more general - it allows you to define equivalence classes
> by using "<" even though the objects are not equal.
>
>
> Andrei

nm, I got it now. >.< I can't believe I didn't know this.


More information about the Digitalmars-d mailing list