tailieunhanh - Data Structures and Algorithms - Chapter 9: Hashing

• Home address: address produced by a hash function. • Prime area: memory that contains all the home addresses. • Synonyms: a set of keys that hash to the same location. • Collision: the location of the data to be inserted is already occupied by the synonym data. | Chapter 9 Basic concepts Hash functions Collision resolution Open addressing Linked list resolution Bucket hashing Cao Hoang Tru CSE Faculty - HCMUT Hashing 1 01 December 2008 Basic Concepts Sequential search O n Binary search O log2n Requiring several key comparisons before the target is found Cao Hoang Tru CSE Faculty - HCMUT 2 01 December 2008 Basic Concepts Search complexity Size Binary Sequential Average Sequential Worst Case 16 4 8 16 50 6 25 50 256 8 128 256 1 000 10 500 1 000 10 000 14 5 000 10 000 100 000 17 50 000 100 000 1 000 000 20 500 000 1 000 000 Cao Hoang Tru CSE Faculty - HCMUT 3 01 December .