This preview shows page 1. Sign up to view the full content.
Unformatted text preview: set S of integers: • Insert( S,x ) inserts x into S . • Delete-Larger-Half( S ) deletes the largest ⌈ S/ 2 ⌉ elements from S . Explain how to implement this data structure so that any sequence of m operations runs in O ( m ) time. 1...
View Full Document
This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.
- Spring '10