MIT's Introduction to Algorithms, Lecture 11: Augmenting Data Structures

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

Art Permalink
June 04, 2009, 22:14

Thank you for doing an excellent job in presenting the material. And thank you and MIT for making the lecture available.

I have a companion problem to the Interval Search that I solved. I've been trying to find other people who have addressed and solved the same issue. You're presentation prompted me to write this note. Perhaps you can direct me to resources.

Given a set of overlapping Intervals, I, and
Given a value within the range of the Intervals (min(I.low), max(I.high)
Find all Intervals which contain the value. min(I.low)

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.