Efficient binary search using two-way comparisons

Andrei Alexandrescu via Digitalmars-d digitalmars-d at puremagic.com
Sat Nov 28 12:04:10 PST 2015

While reading Okasaki's bool on persistent data structures, I found 
(page 14) a reference to a nice idea applicable to binary search using 
D's two-way "less than" comparisons.


Any takers?


More information about the Digitalmars-d mailing list