On 4/8/2011 6:09, Invisible wrote:
> However, according to Wikipedia, it does everything in logarithmic time.

It moves forward and back in linear time. It moves far forward in 
logarithmic time if you make it tall enough. It's like an unholy union of 
tree and list that automatically keeps itself balanced. It's worth reading 
about, because it's interesting and easy to understand.

The nice thing is a skip graph, which is as efficient as a skip list except 
you can make it distributed like a DHT.

-- 
Darren New, San Diego CA, USA (PST)
   "Coding without comments is like
    driving without turn signals."

Post a reply to this message