Le 30/06/2011 19:26, Gabriel Scherer a écrit :
implementation -- or more exotic heaps. I was once in a situation similar to yours and found that I could implement both his leftist heap and the red-black trees in around 15 minutes.
Wow, that's impressive! But I guess you didn't need to implement the remove operation on red-black trees :-) That's a real pain.
Frankly, AVLs are not *that* difficult to implement. And contrary to what you can read in some books, it is really difficult to get anything faster.
-- Jean-Christophe -- Caml-list mailing list. Subscription management and archives: https://sympa-roc.inria.fr/wws/info/caml-list Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
