Map Hash Tables and Dictionaries_Part_9

Map Hash Tables and Dictionaries_Part_9 - Sorted List...

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

View Full Document Right Arrow Icon
Last Updated: 06/02/12 10:23 PM CSE 2011 Prof. J. Elder - 41 - Ordered Search Tables Performance: find takes O (log n ) time, using binary search insert takes O ( n ) time since in the worst case we have to shift n items to make room for the new item remove takes O ( n ) time since in the worst case we have to shift n items to compact the items after the removal A search table is effective only for dictionaries of small size or for dictionaries on which searches are the most common operations, while insertions and removals are rarely performed (e.g., credit card authorizations)
Background image of page 1

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

View Full DocumentRight Arrow Icon
Last Updated: 06/02/12 10:23 PM CSE 2011 Prof. J. Elder - 42 - More on Binary Search
Background image of page 2
Last Updated: 06/02/12 10:23 PM CSE 2011 Prof. J. Elder - 43 - Define Problem: Binary Search PreConditions Key 25
Background image of page 3

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

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

Unformatted text preview: Sorted List PostConditions Find key in list (if there). 3 5 6 13 18 21 21 25 36 43 49 51 53 60 72 74 83 88 91 95 3 5 6 13 18 21 21 25 36 43 49 51 53 60 72 74 83 88 91 95 Last Updated: 06/02/12 10:23 PM CSE 2011 Prof. J. Elder - 44 - Define Loop Invariant Maintain a sublist. If the key is contained in the original list, then the key is contained in the sublist. key 25 3 5 6 13 18 21 21 25 36 43 49 51 53 60 72 74 83 88 91 95 Last Updated: 06/02/12 10:23 PM CSE 2011 Prof. J. Elder - 45 - Define Step Cut sublist in half. Determine which half the key would be in. Keep that half. key 25 3 5 6 13 18 21 21 25 36 43 49 51 53 60 72 74 83 88 91 95 If key mid , then key is in left half. If key > mid , then key is in right half. mid...
View Full Document

Page1 / 5

Map Hash Tables and Dictionaries_Part_9 - Sorted List...

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

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