Hash-table:Basic Idea Hashing:the idea Q:When should we use hash table? What situations is the hash table suitable for? Feasible size Very large,but only a small E[O] part is used in an applica- E[1] tion at a certain time. Key Space E[m-1] ，口+4心，。法·生，生 0a0
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hash-table: Basic Idea Hashing: the idea Q : When should we use hash table? What situations is the hash table suitable for? Key Space x Very large, but only a small part is used in an application at a certain time. · · · · · · E [0] E [1] E [m − 1] Feasible size E [k] Hash Function Index distribution Collision handling MA Jun (Institute of Computer Software) Problem Solving May 14, 2020 3 / 34
Hash-table:Basic Idea Hashing:the idea Q:When should we use hash table? What situations is the hash table suitable for? Feasible size Very large,but only a small E[O] part is used in an applica- E[) tion at a certain time. E[K个 Hash Function Key Space E[m-1] 0a0
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hash-table: Basic Idea Hashing: the idea Q : When should we use hash table? What situations is the hash table suitable for? Key Space x Very large, but only a small part is used in an application at a certain time. · · · · · · E [0] E [1] E [m − 1] Feasible size E [k] Hash Function Index distribution Collision handling MA Jun (Institute of Computer Software) Problem Solving May 14, 2020 3 / 34
Hash-table:Basic Idea Hashing:the idea Q:When should we use hash table? What situations is the hash table suitable for? Feasible size Very large,but only a small E[O] part is used in an applica- E o Index distribution tion at a certain time. ● Collision handling E[k个 Hash Function Key Space E[m-1] 口卡+①，2是生QC MA Jun (Institute of Computer Software) Problem Solving May14,20203/34
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hash-table: Basic Idea Hashing: the idea Q : When should we use hash table? What situations is the hash table suitable for? Key Space x Very large, but only a small part is used in an application at a certain time. · · · · · · E [0] E [1] E [m − 1] Feasible size E [k] Hash Function Index distribution Collision handling MA Jun (Institute of Computer Software) Problem Solving May 14, 2020 3 / 34
Hash-table:Basic Idea Hashing:the idea Q:What is a Collision?When does it take place? 口卡+①，2是生Q0 MA Jun (Institute of Computer Software) Problem Solving May14.20204/34
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hash-table: Basic Idea Hashing: the idea Q : What is a Collision? When does it take place? Hash Function Key Space · · · · · · E [0] E [1] E [m − 1] x y E [k] MA Jun (Institute of Computer Software) Problem Solving May 14, 2020 4 / 34
Hash-table:Basic Idea Hashing:the idea Q:What is a Collision?When does it take place? E[O] E[] Hash Function Key Space 。++ E[m-1] 口卡4心，，之·生空 0a0
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hash-table: Basic Idea Hashing: the idea Q : What is a Collision? When does it take place? Hash Function Key Space · · · · · · E [0] E [1] E [m − 1] x y E [k] MA Jun (Institute of Computer Software) Problem Solving May 14, 2020 4 / 34