Design a data structure that supports the following two operations on a set S of integers: a. Insert(x; S), which inserts element x into set S, and b. DeleteLargerHalf(S), which deletes the largest ceil(|S|/2) elements from S. Show how to implement this data structure so both operations take O(1) amortized time.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
