[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | blue storm <bluestorm.dylc@g...> |
| Subject: | Re: [Caml-list] Heap implementations: Fibonacci, Brodal and relaxed |
First of all, do you know about Okasaki leftist heaps (I suppose you do as you're asking for even more advanced data structure) ? They're simple O(log n) heap, nice to implement (~ 20 lines). There was a page from Markus Mottl with translated OCaml code from the book, but he removed it for some obscure reason.