MIT6_851S10_assn09_sol

MIT6_851S10_assn09_sol - inserting x to the vEB. This way,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
6.851 Advanced Data Structures (Spring’10) Prof. Erik Demaine Dr. Andr´ e Schulz TA: Aleksandar Zlateski Problem 9 Sample Solutions Dynamic partition of [n] into intervals. If we choose name( x ) to be the largest number in the interval, we can easily solve this problem using a vEB tree. To answer name( x ) we query vEB for succ( x ) , to perform merge( x ) we delete name( x ) from the vEB, and we perform divide( x ) by
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: inserting x to the vEB. This way, all operations work on O (log log n ) time. 1 MIT OpenCourseWare http://ocw.mit.edu 6.851 Advanced Data Structures Spring 2010 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms ....
View Full Document

Page1 / 2

MIT6_851S10_assn09_sol - inserting x to the vEB. This way,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online