p. 424 · PDF 434

2-2-3 Hash Search Algorithm

Hash search algorithm is a search algorithm that uses hash table which determines the storage location (i.e., index) from the data to be stored. From the target value, the storage location of data is determined by calculation (hash function). Therefore, it can basically find the target value with one round of searching. The main point is the process when synonym has occurred. An algorithm is considered. Here, the algorithm searches for the key that matches with the entered target value X from the recorded data in the following hash table (i.e., array) and returns the data that corresponds to this key. When a key that matches with the target value X does not exist, the message “Not Found!” is returned. · 1 question

Enlarge original visual

Source visual description

Original Hash Search Algorithm source layout. Source labels: .

In this hash table, chain method is used, which reserves the synonym area to store synonym records, and connects them with pointers. Therefore, when the key of the storage location that is determined from the target value does not match with the target value, synonym records are traced with the help of pointers. Figure 7-25 shows this flowchart.

p. 425 · PDF 435

Enlarge original visual

Original source text

Figure 7-25  Hash search algorithm 

Source visual description

The original hash-search chart calculates a storage location and follows pointer fields while comparing the stored values with X.