MIT's Introduction to Algorithms, Lectures 22 and 23: Cache Oblivious Algorithms

You're viewing a comment by Sapping and its responses.

Sapping Permalink
December 18, 2009, 19:33

On the first page of your lecture notes for Lecture 23, in the analysis of static search trees, you have that the triangle (subtree) ≤ B is ≥ than log B. I think it should be the triangle ≤ B is ≥ than 1/2 log B. But other than that, thank you again for posting these, they really help when combined with the blackboard notes.

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.