CS223-0221-Collision

CS223-0221-Collision - Collision Resolution Neil Tang CS223...

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

View Full Document Right Arrow Icon
CS223 Advanced Data Structures and Algorithms 1 Collision Resolution Collision Resolution Neil Tang Neil Tang 02/21/2008 02/21/2008
Background image of page 1

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

View Full Document Right Arrow Icon
CS223 Advanced Data Structures and Algorithms 2 Class Overview Class Overview Separate chaining Load factor Open addressing: linear probing, quadratic probing and double hashing Rehashing
Background image of page 2
CS223 Advanced Data Structures and Algorithms 3 Separate Chaining Separate Chaining hash(x) = x mod 10
Background image of page 3

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

View Full Document Right Arrow Icon
CS223 Advanced Data Structures and Algorithms 4 Construct the Table Construct the Table
Background image of page 4
CS223 Advanced Data Structures and Algorithms 5 Chaining Operations Chaining Operations
Background image of page 5

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

View Full Document Right Arrow Icon
CS223 Advanced Data Structures and Algorithms 6 Load Factor Load Factor Load factor λ = N/M, where N is the number of elements and M is the table size. The average length of a list is λ . In unsuccessful search, the number of elements to examine is λ on average. A successful search requires (1+ λ /2) links to be traversed on average.
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 16

CS223-0221-Collision - Collision Resolution Neil Tang CS223...

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

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