Hash Table Efficiency

Loading Factor of the open address method:

Loadfactor = nitems/arraysize;

A hash table with 10000 units is filled with 6667 pieces of data.

Its filling factor is 2/3.

 

Loading Factor of the link address method: generally larger than 1.

If there are many items in the linked list, the access time will become longer.

Because access to specific data to the average needs to search for half of the data items in the linked list.

Find the time level required for the initial unit o [1.

The search linked list time is positively compared with the m <average data items included in the Linked List>. O [m]

Hash Table efficiency:

<No conflict occurred>

Insert O [1]

Search for o [1]

<Conflict>

Hash Table Efficiency