JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding a space

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-07 13:46:07 -05:00
parent 0ff35808d6
commit bb35ef8c96
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lectures/20_hash_tables_I/README.md
View File

@@ -204,7 +204,7 @@ More generally, the jth “probe” of the table is (i + c<sub>1</sub>j + c<sub>
– Secondary hashing: when a collision occurs a second hash function is applied to compute a new table location. This is repeated until an empty location is found.
- For each of these approaches, the find operation follows the same sequence of locations as the insert operation. The key value is determined to be absent from the table only when an empty location is found.
- When using open addressing to resolve collisions, the erase function must mark a location as “formerly occupied”. If a location is instead marked empty, find may fail to return elements in the table. Formerlyoccupied locations may (and should) be reused, but only after the find operation has been run to completion.
- When using open addressing to resolve collisions, the erase function must mark a location as “formerly occupied”. If a location is instead marked empty, find may fail to return elements in the table. Formerly occupied locations may (and should) be reused, but only after the find operation has been run to completion.
- Problems with open addressing:
– Slows dramatically when the table is nearly full (e.g. about 80% or higher). This is particularly problematic for linear probing.