>
>
> But here would be an interesting situation: what if all the Heap inserts
> do end up being faster, but popping every element off is slower because
> deleteMin()'s constant is so high? Well, then there's a cross-over point
> that would be nice to know about. It might be better to use the he
oh, but there's one other little point, which is that sets typically store
unique values where that requirement is lifted from heaps.
On Sun, Apr 19, 2009 at 1:52 PM, e wrote:
> thank you for the idea.
>
> Here's how I extrapolate in terms of doing comparisons/experimentation:
>
> If sorted-set
thank you for the idea.
Here's how I extrapolate in terms of doing comparisons/experimentation:
If sorted-set does the sort in advance, then this would be a way to delay
some of that work, but if my implementation is too terrible, then there's a
chance that the sorted-set is more practical. That
I'm curious to know how this approach compares to using Clojure's
sorted sets or hash tables.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Clojure" group.
To post to this group, send email to clojure@googlegroups
