As a professional technician, professional nouns must be mastered.
Requirements:
Understand the meaning
Know how to read
1. hash function hashing function
In a general linear table, in a tree, the relative position of the record in the structure is random, i.e. there is no deterministic relationship between the recorded keywords, so a series of comparisons with the keywords are required to find the records in the structure. This type of lookup method is based on the comparison, and the efficiency of the lookup depends on the number of comparisons made during the lookup process. Ideally, you can directly find the records you need, so you must establish a definite correspondence between where the record is stored and its key words F, so that each keyword and a unique storage location in the structure correspond.
That reminds me of HashMap.
Java Communication Terminology Mastery