12 - Hash Tables.pdf-Dictionaries and Ha...
12_-_Hash_Tables.pdf-Dictionaries and Hash Tables ∅ ∅
Showing 10 out of 10
12 - Hash Tables.pdf-Dictionaries and Hash Tables ...
12_-_Hash_Tables.pdf-Dictionaries and Hash Tables ∅ ∅
12 - Hash Tables.pdf-Dictionaries a...
12_-_Hash_Tables.pdf-Dictionaries and Hash Tables ∅ ∅
Page 10
Dictionaries and Hash Tables
19
Performance of
Hashing
In the worst case, searches,
insertions and removals on a
hash table take
O
(
n
)
time
The worst case occurs when
all the keys inserted into the
dictionary collide
The load factor
α
=
n
/
N
affects
the performance of a hash
table
Assuming that the hash values
are like random numbers, it
can be shown that the
expected number of probes
for an insertion with open
addressing is
1
/
(1
α
)
The expected running
time of all the dictionary
ADT operations in a hash
table is
O
(1)
In practice, hashing is
very fast provided the
load factor is not close
to 100%
Applications of hash
tables:
small databases
compilers
browser caches


Ace your assessments! Get Better Grades
Browse thousands of Study Materials & Solutions from your Favorite Schools
Concordia University
Concordia_University
School:
Data_Structures_and_Algorithms
Course:
Great resource for chem class. Had all the past labs and assignments
Leland P.
Santa Clara University
Introducing Study Plan
Using AI Tools to Help you understand and remember your course concepts better and faster than any other resource.
Find the best videos to learn every concept in that course from Youtube and Tiktok without searching.
Save All Relavent Videos & Materials and access anytime and anywhere
Prepare Smart and Guarantee better grades

Students also viewed documents