How do we handle duplicates with separate chaining? - PowerPoint PPT Presentation

1 / 2
About This Presentation
Title:

How do we handle duplicates with separate chaining?

Description:

Rehashing (also called double hashing) - when collision occurs determine step to search for available cell by hashing the key value again by a new function. – PowerPoint PPT presentation

Number of Views:18
Avg rating:3.0/5.0
Slides: 3
Provided by: tcnjEdu7
Category:

less

Transcript and Presenter's Notes

Title: How do we handle duplicates with separate chaining?


1
How do we handle duplicates with separate
chaining?
How do we handle deletions?
2
7. What is the advantage of a hash table?
O(1) complexity to search for or insert an item
(i.e. constant time regardless of the number of
items).
8. Disadvantage?
Must know size of array needed in advance (in
Java arrays can not be resized - another bigger
array would be needed). This problem is reduced
when separate chaining is used.
Also, there is no way to access items in order.
Write a Comment
User Comments (0)
About PowerShow.com