Radu Grigore wrote: > With a time limit of three hours this is what I'd do. In a real program, I'd > probably go for binomial heaps if imperative is OK, or maxiphobic heaps if > persistence is important.
FWIW, I found that Okasaki's binomial heaps are among the slowest. Pairing heaps were the fastest overall, closely followed by leftist heaps in OCaml. If elements are inserted in order then the leftist heap is ~3x slower than a pairing heap in OCaml and ~5x slower in F#. Cheers, Jon. -- 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
