From bb35ef8c96a1da500b0fd7733024f4b2c1274c47 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Tue, 7 Nov 2023 13:46:07 -0500 Subject: [PATCH] adding a space --- lectures/20_hash_tables_I/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/20_hash_tables_I/README.md b/lectures/20_hash_tables_I/README.md index 9cde345..c30a2b7 100644 --- a/lectures/20_hash_tables_I/README.md +++ b/lectures/20_hash_tables_I/README.md @@ -204,7 +204,7 @@ More generally, the jth “probe” of the table is (i + c1j + c – 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.