MIT's Introduction to Algorithms, Lecture 12: Skip Lists

You're viewing a comment by Ryan Ingram and its responses.

Ryan Ingram Permalink
October 18, 2008, 20:50

These are MIT students? They're either incredibly shy, or not as smart as we've been led to believe; lots of the questions during the lecture were no brainers yet nobody is peeping up.

He even alludes to flipping a coin during the introduction, and then when he gets to the question where the obvious answer is "flip a coin", nobody seems to remember.

On the other hand, cool data structure. The "easy to implement" advantage is a nice bonus over balanced trees; are there performance benefits as well or are you just less likely to screw it up?

Also, no love for splay trees?

Reply to this comment

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Comment Help

Type first 3 letters of your name: (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.