[erlang-questions] rbdict - A dictionary as a Red-Black tree

[Robert Virding]

2008/6/16 Robert Virding <rvirding@REDACTED>:

>
> This is expected, rb-trees are O(n lg n) but dict is based on a hashing
> algorithm as is almost O(1).
>

I made a mistake here as Fuad pointed out to me, rb-trees are of course O(lg
n).

Robert
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20080616/b5c22f36/attachment.htm>