This preview shows page 1. Sign up to view the full content.
Unformatted text preview: DELETE, SEARCH and MIN-GAP as ecient as possible and analyze their running times.) 5. Suppose you want to maintain a set of dynamic intervals (i.e. there are insertions into and deletions from the set) in order to be able to query eciently whether a given interval contains any of the intervals in the set. What data structure would you want to use and what information would need to be stored? Describe an algorithm for implementing the query in sucient detail so that you can analyze the time required to respond to the query. Show that the extra information you need can be maintained during the insertions and deletions. 1...
View Full Document
This document was uploaded on 03/23/2011.
- Summer '09