On 04/08/2011 02:09 PM, Invisible wrote:
> No - mainly because I've never heard of it. ;-)
>
> However, according to Wikipedia, it does everything in logarithmic time.
> Well, so does a tree [assuming you can keep it balanced]. Haskell
> already has a bazillion different tree implementations [although I don't
> recall seeing a mutable one recently].

Skip lists structure is claimed to be so simple,
that it could be easily implemented within an hour
without a textbook  (http://goo.gl/yDqKJ).

Post a reply to this message