MIT6_851S10_assn01

# MIT6_851S10_assn01 - redux. Give a purely geometric...

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

6.851 Advanced Data Structures (Spring’10) Prof. Erik Demaine Dr. Andr´ e Schulz TA: Aleksandar Zlateski Problem 1 Due: Thursday, Feb. 11 Be sure to read the instructions on the assignments section of the class web page. Transposing a matrix. Prove that there is a binary search tree supporting the access sequence 0 ,k, 2 k,. ..,k 2 k, 1 ,k + 1 , 2 k + 1 ,...,k 2 k + 1 ,...... ,k 1 , 2 k 1 , 3 k 1 ,...,k 2 1 in constant amortized time per operation. (This access sequence is equivalent to accessing a k × k matrix of entries, in column-major order, when the items are stored in row-major order.) Logarithmic

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: redux. Give a purely geometric argument that there is a binary search tree sup-porting any m searches on n items in O ( m log n ) total time. (Reason about point sets, not binary search trees.) 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

## This note was uploaded on 03/31/2011 for the course EECS 6.851 taught by Professor Erikdemaine during the Spring '10 term at MIT.

### Page1 / 2

MIT6_851S10_assn01 - redux. Give a purely geometric...

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

View Full Document
Ask a homework question - tutors are online