2c03-review - 00026

2c03-review - 00026 - addressing with linear probing is...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
4 c) 8, 5 , 9, 3 , 2, 10 5, 8 , 3, 9 , 2, 10 \ / | 3, 5, 8, 9, 2, 10 \ / 2, 3, 5, 8, 8, 10, 9 Worst case and average case are O(n logn) 6.[10] Suppose we are hashing integers with a hash table of length 5 using the hash function h(i)=i mod 5. a.[5] Show the resulting hash table if 11, 46, 52, 61, 34 are inserted and open
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: addressing with linear probing is used. b.[5] Repeat (a) using a closed hash table with collisions resolved by chaining. a) 0 34 1 11 2 46 3 52 4 61 b) 0 1 11 46 61 2 52 3 4 34...
View Full Document

This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.

Ask a homework question - tutors are online