Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #10268 > unrolled thread

In general skip lists and splay trees can't hold candle to hash tables

Back to article view | Back to comp.programming

Contents

  In general skip lists and splay trees can't hold candle to hash tables aminer68@gmail.com - 2019-10-18 11:28 -0700
    Re: In general skip lists and splay trees can't hold candle to hash tables Richard Damon <Richard@Damon-Family.org> - 2019-10-18 16:00 -0400

#10268 — In general skip lists and splay trees can't hold candle to hash tables

Hello,


In general skip lists and splay trees can't hold candle to hash tables.

Read more here to noticed it:

http://harisankar-krishnaswamy.blogspot.com/2012/04/skip-list-runtime-on-dictionay.html



Thank you,
Amine Moulay Ramdane.

[toc] | [next] | [standalone]

#10270

On 10/18/19 2:28 PM, aminer68@gmail.com wrote:
> Hello,
> 
> 
> In general skip lists and splay trees can't hold candle to hash tables.
> 
> Read more here to noticed it:
> 
> http://harisankar-krishnaswamy.blogspot.com/2012/04/skip-list-runtime-on-dictionay.html

> 
> Thank you,
> Amine Moulay Ramdane.
> 

Until of course, you want to do an operation that actually needs the
data sorted, like visit all nodes in order or find all nodes between two
key values, hash tables don't support these actions well at all.

So, if all you need is uniqueness, hash tables rule.
If you need sorted data, not so much.

[toc] | [prev] | [standalone]

Back to top | Article view | comp.programming

csiph-web